This article develops an axiomatic basis for the relationship between conditional independence and graphical models in statistical analysis. In particular, the following relationships are established: (1) every axiom for conditional independence is an axiom for graph separation, (2) every graph represents a consistent set of independence and dependence constraints, (3) all binary factorizations of strictly positive probability models can be encoded and determined in polynomial time using their correspondence to graph separation, (4) binary factorizations of non-strictly positive probability models can also be derived in polynomial time albeit less efficiently and (5) unconditional independence relative to normal models can be axiomatized with a finite set of axioms.
@article{1176349407,
author = {Geiger, Dan and Pearl, Judea},
title = {Logical and Algorithmic Properties of Conditional Independence and Graphical Models},
journal = {Ann. Statist.},
volume = {21},
number = {1},
year = {1993},
pages = { 2001-2021},
language = {en},
url = {http://dml.mathdoc.fr/item/1176349407}
}
Geiger, Dan; Pearl, Judea. Logical and Algorithmic Properties of Conditional Independence and Graphical Models. Ann. Statist., Tome 21 (1993) no. 1, pp. 2001-2021. http://gdmltest.u-ga.fr/item/1176349407/