Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Castelo, R.: The Discrete Acyclic Digraph Markov Model in Data Mining. PhD Thesis, Utrecht University (2002)
Gillispie, S.B.: Formulas for Counting Acyclic Digraph Markov Equivalence Classes. Journal of Statistical Planning and Inference, 1410–1432 (2006)
Gillispie, S.B., Perlman, M.D.: The Size Distribution for Markov Equivalence Classes of Acyclic Digraph Models. Artificial Intelligence, 137–155 (2002)
Harary, F., Palmer, E.M.: Graphical Enumeration. Academic Press (1973)
He, Y., Jia, J., Yu, B.: Reversible MCMC on Markov Equivalence Classes of Sparse Directed Acyclic Graphs. arXiv:1209.5860v2 [stat.ML]
Peña, J.M.: Approximate Counting of Graphical Models Via MCMC. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, pp. 352–359 (2007)
Perlman, M.D.: Graphical Model Search Via Essential Graphs. Technical Report 367, University of Washington (2000)
Robinson, R.W.: Counting Labeled Acyclic Digraphs. In: New Directions in the Theory of Graphs, pp. 239–273 (1973)
Robinson, R.W.: Counting Unlabeled Acyclic Digraphs. In: Proceedings of the Fifth Australian Conference on Combinatorial Mathematics, pp. 28–43 (1977)
Steinsky, B.: Enumeration of Labelled Chain Graphs and Labelled Essential Directed Acyclic Graphs. Discrete Mathematics, 266–277 (2003)
Steinsky, B.: Asymptotic Behaviour of the Number of Labelled Essential Acyclic Digraphs and Labelled Chain Graphs. Graphs and Combinatorics, 399–411 (2004)
The On-Line Encyclopedia of Integer Sequences (2010), published electronically at http://oeis.org
Wright, E.M.: A Relationship between Two Sequences. In: Proceedings of the London Mathematical Society, 296–304 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peña, J.M. (2013). Approximate Counting of Graphical Models via MCMC Revisited. In: Bielza, C., et al. Advances in Artificial Intelligence. CAEPIA 2013. Lecture Notes in Computer Science(), vol 8109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40643-0_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-40643-0_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40642-3
Online ISBN: 978-3-642-40643-0
eBook Packages: Computer ScienceComputer Science (R0)