On the toric algebra of graphical models

By Dan Geiger, Christopher Meek, Bernd Sturmfels. 2006

209 citations recorded by the source corpus.

We formulate necessary and sufficient conditions for an arbitrary discrete probability distribution to factor according to an undirected graphical model, or a log-linear model, or other more general exponential models. For decomposable graphical models these conditions are equivalent to a set of conditional independence statements similar to the Hammersley-Clifford theorem; however, we show that for nondecomposable graphical models they are not. We also show that nondecomposable models can have nonrational maximum likelihood estimates. These results are used to give several novel characterizations of decomposable graphical models.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/900175ec07667b73a2c0c857855bb0df1df50c8d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mathias Drton
  2. Marloes H. Maathuis
  3. Alessandro Rinaldo
  4. Stephen E. Fienberg
  5. Lior S. Pachter
  6. Bernd Sturmfels
  7. Amit Khetan
  8. F. Catanese

In Computational Theory and Mathematics

  1. Bernd Sturmfels
  2. Mathias Drton
  3. Seth Sullivant
  4. Thomas Kahle
  5. Alessandro Rinaldo
  6. Stephen E. Fienberg
  7. Lior S. Pachter
  8. Marloes H. Maathuis

Citations in the corpus