![]() |
CiteULike | ![]() |
yaroslavvb's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
On the Toric Algebra of Graphical Models |
Reviews
[Write a review of this article]
Notes for this article
- Hammersley-Clifford related independence equations to the form of positive distributions satisfying those equations (factored into clique potentials).
- Distribution factors according to A if it's in the image of phi_A
- Factorization theorem -- P factors according to A iff the support of P is nice and all polynomials in an ideal basis of the toric ideal I_A vanish at P
- In addition to independence equations, "cross-product ratios" enter for non-decomposable models:
- ie, simplest non-decomposable model (4 loop) has following condition (in addition to independence equations and other cpr constraints):
p0100 p0111 p1001 p1010 = p0101 p0110 p1000 p1011
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe 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. This characterization generalizes the well-known Hammersley-Clifford Theorem. We show that for decomposable graphical models these conditions are equivalent to a set of statistical independence facts as in the Hammersley-Clifford Theorem but that for non-decomposable graphical models they are not. We also show that non-decomposable models can have non-rational maximum likelihood estimates. Finally, using these results, we provide a characterization of decomposable graphical models.
BibTeX record
RIS record