On chain graph models for description of conditional independence structures

A chain graph (CG) is a graph admitting both directed and undirected edges with (partially) directed cycles forbidden. It generalizes both the concept of undirected graph (UG) and the concept of directed acyclic graph (DAG). A chain graph can be used to describe efficiently the conditional independence structure of a multidimensional discrete probability distribution in the form of a graphoid, that is, in the form of a list of statements X is independent of Y given Z obeying a set of five properties (axioms). An input list of independency statements for every CG is defined and it is shown that the classic moralization criterion for CGs embraces exactly the graphoid closure of the input list. A new direct separation criterion for reading independency statements from a CG is introduced and shown to be equivalent to the moralization criterion. Using this new criterion, it is proved that for every CG, there exists a strictly positive discrete probability distribution that embodies exactly the independency statements displayed by the graph. Thus, both criteria are shown to be complete and the use of CGs as tools for description of conditional independence structures is justified.

[1]  A. Dawid Conditional Independence in Statistical Theory , 1979 .

[2]  T. Speed,et al.  Recursive causal models , 1984, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[3]  Dan Geiger,et al.  On the logic of causal models , 2013, UAI.

[4]  Judea Pearl,et al.  Causal networks: semantics and expressiveness , 2013, UAI.

[5]  N. Wermuth,et al.  Graphical Models for Associations between Variables, some of which are Qualitative and some Quantitative , 1989 .

[6]  李幼升,et al.  Ph , 1989 .

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Dan Geiger,et al.  Identifying independence in bayesian networks , 1990, Networks.

[9]  J. N. R. Jeffers,et al.  Graphical Models in Applied Multivariate Statistics. , 1990 .

[10]  N. Wermuth,et al.  On Substantive Research Hypotheses, Conditional Independence Graphs and Graphical Chain Models , 1990 .

[11]  M. Frydenberg The chain graph Markov property , 1990 .

[12]  Steffen L. Lauritzen,et al.  Independence properties of directed markov fields , 1990, Networks.

[13]  Milan Studený Formal Properties of Conditional Independence in Different Calculi of AI , 1993, ECSQARU.

[14]  J. Pearl,et al.  Logical and Algorithmic Properties of Conditional Independence and Graphical Models , 1993 .

[15]  Wray L. Buntine Chain graphs for learning , 1995, UAI.

[16]  Christopher Meek,et al.  Strong completeness and faithfulness in Bayesian networks , 1995, UAI.

[17]  Peter Spirtes,et al.  Directed Cyclic Graphical Representations of Feedback Models , 1995, UAI.

[18]  Christopher Meek,et al.  Causal inference and causal explanation with background knowledge , 1995, UAI.

[19]  Milan Studený,et al.  Chain graphs: semantics and expressiveness , 1995, ECSQARU.

[20]  Nanny Wermuth,et al.  Multivariate Dependencies: Models, Analysis and Interpretation , 1996 .

[21]  David Madigan,et al.  An Alternative Markov Property for Chain Graphs , 1996, UAI.

[22]  Milan Studený,et al.  A recovery algorithm for chain graphs , 1997, Int. J. Approx. Reason..

[23]  D. Madigan,et al.  A characterization of Markov equivalence classes for acyclic digraphs , 1997 .

[24]  D. Madigan,et al.  On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs , 1997 .

[25]  Thomas S. Richardson,et al.  Chain Graphs and Symmetric Associations , 1998, Learning in Graphical Models.

[26]  Milan Studený Bayesian Networks from the Point of View of Chain Graphs , 1998, UAI.

[27]  Michael I. Jordan Graphical Models , 2003 .

[28]  Milan Studený,et al.  A graphical characterization of the largest chain graphs , 1999, Int. J. Approx. Reason..