Enumerating Markov Equivalence Classes of Acyclic Digraph Models

Graphical Markov models determined by acyclic digraphs (ADGs), also called directed acyclic graphs (DAGs), are widely studied in statistics, computer science (as Bayesian networks), operations research (as influence diagrams), and many related fields. Because different ADGs may determine the same Markov equivalence class, it long has been of interest to determine the efficiency gained in model specification and search by working directly with Markov equivalence classes of ADGs rather than with ADGs themselves. A computer program was written to enumerate the equivalence classes of ADG models as specified by Pearl & Verma's equivalence criterion. The program counted equivalence classes for models up to and including 10 vertices. The ratio of numbers of classes to ADGs appears to approach an asymptote of about 0.267. Classes were analyzed according to number of edges and class size. By edges, the distribution of number of classes approaches a Gaussian shape. By class size, classes of size 1 are most common, with the proportions for larger sizes initially decreasing but then following a more irregular pattern. The maximum number of classes generated by any undirected graph was found to increase approximately factorially. The program also includes a new variation of orderly algorithm for generating undirected graphs.

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

[2]  Finn Verner Jensen,et al.  Introduction to Bayesian Networks , 2008, Innovations in Bayesian Networks.

[3]  P. R. Stein,et al.  ENUMERATION OF LINEAR GRAPHS AND CONNECTED LINEAR GRAPHS UP TO P = 18 POINTS. , 1963 .

[4]  D. Madigan,et al.  Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs , 1996 .

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

[6]  Judea Pearl,et al.  An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation , 1992, UAI.

[7]  Judea Pearl,et al.  Equivalence and Synthesis of Causal Models , 1990, UAI.

[8]  D. Edwards.  Introduction to graphical modelling , 1995 .

[9]  David J. Spiegelhalter,et al.  Sequential updating of conditional probabilities on directed graphical structures , 1990, Networks.

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

[11]  Michael I. Jordan.  Graphical Models , 1998 .

[12]  D. Madigan,et al.  Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window , 1994 .

[13]  Wray L. Buntine.  Operations for Learning with Graphical Models , 1994, J. Artif. Intell. Res..

[14]  R. Read.  Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[15]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[16]  David J. Spiegelhalter,et al.  Bayesian analysis in expert systems , 1993 .

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

[18]  G. Pólya.  Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[19]  Richard E. Neapolitan,et al.  Probabilistic reasoning in expert systems - theory and algorithms , 2012 .

[20]  David Maxwell Chickering,et al.  A Transformational Characterization of Equivalent Bayesian Network Structures , 1995, UAI.

[21]  A. P. Dawid,et al.  Independence properties of directed Markov fields. Networks, 20, 491-505 , 1990 .

[22]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[23]  C. Robert Kenley,et al.  Gaussian influence diagrams , 1989 .

[24]  Walter Oberschelp,et al.  Kombinatorische Anzahlbestimmungen in Relationen , 1967 .

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

[26]  Richard E. Neapolitan,et al.  Probabilistic reasoning in expert systems - theory and algorithms , 2012 .

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

[28]  F. Harary.  New directions in the theory of graphs , 1973 .

[29]  Charles J. Colbourn,et al.  Orderly algorithms for graph generation , 1979 .

[30]  David Maxwell Chickering,et al.  Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.

[31]  Jayme Luiz Szwarcfiter,et al.  Generating all the Acyclic Orientations of an Undirected Graph , 1999, Inf. Process. Lett..

[32]  R. Christensen.  Introduction to Graphical Modeling , 2001 .