The algebra of causal trees and chain event graphs

  • Jim Smith (The University of Warwick, Warwick, United Kingdom)
Raum n.n. Universität Leipzig (Leipzig)


One of the most flexible ways of representing families of discrete probability distributions is through event trees and the chain event graph. These are also extremely useful for representing causal hypotheses. In this talk I will show how the algebra associated with event tree families is less constrained and therefore more expressive than its Bayesian Network competitor. I will illustrate how an understanding of the algebraic features of these models gives insight into their underlying structure.


8/2/10 8/6/10

Information Geometry and its Applications III

Universität Leipzig Raum n.n.

Antje Vandenberg

Max-Planck-Institut für Mathematik in den Naturwissenschaften Contact via Mail

Nihat Ay

Max Planck Institute for Mathematics in the Sciences, Germany

Paolo Gibilisco

Università degli Studi di Roma "Tor Vergata", Italy

František Matúš

Academy of Sciences of the Czech Republic, Czech Republic