Approximate Counting of Graphical Models via MCMC Revisited

In [6], MCMC sampling is applied to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20 nodes. In the present paper, we extend that work from 20 to 31 nodes. We also extend that work by computing the approximate ratio of connected EGs to connected DAGs, of connected EGs to EGs, and of connected DAGs to DAGs. Furthermore, we prove that the latter ratio is asymptotically 1. We also discuss the implications of these results for learning DAGs from data.

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

[2]  N. Andrei,et al.  Asymptotic behaviour of essential graphs , 2009 .

[3]  S. Gillispie.  Formulas for counting acyclic digraph Markov equivalence classes , 2006 .

[4]  N. Wermuth,et al.  Sequences of regressions and their independences , 2011, 1110.1986.

[5]  Michael D. Perlman,et al.  The size distribution for Markov equivalence classes of acyclic digraph models , 2002, Artif. Intell..

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

[7]  Frank Harary,et al.  Graphical enumeration , 1973 .

[8]  Mikhail Nikulin,et al.  Statistical planning and inference in accelerated life testing using the CHSS model , 2004 .

[9]  Thomas S. Richardson,et al.  Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables , 2005, UAI.

[10]  E. M. Wright.  A Relationship Between two Sequences , 1967 .

[11]  Olle Häggström.  Finite Markov Chains and Algorithmic Applications , 2002 .

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

[13]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[15]  Frank Harary.  Chapter 1 – LABELED ENUMERATION , 1973 .

[16]  Bin Yu,et al.  Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs , 2012, ArXiv.

[17]  R. W. Robinson.  Counting unlabeled acyclic digraphs , 1977 .

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

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

[20]  N. Wermuth,et al.  Linear Dependencies Represented by Chain Graphs , 1993 .

[21]  J. Peña,et al.  Learning Multivariate Regression Chain Graphs under Faithfulness , 2012, PGM 2012.

[22]  Bertran Steinsky.  Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs , 2004, Graphs Comb..

[23]  Bertran Steinsky,et al.  Enumeration of labelled chain graphs and labelled essential directed acyclic graphs , 2003, Discret. Math..

[24]  José M. Peña,et al.  Chain Graph Interpretations and Their Relations , 2013, ECSQARU.

[25]  José M. Peña,et al.  Approximate Counting of Graphical Models Via MCMC , 2007, AISTATS.

[26]  Juan Roberto Castelo Valdueza,et al.  The Discrete Acyclic Digraph Markov Model in Data Mining , 2002 .

[27]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

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