Formulas for counting acyclic digraph Markov equivalence classes

Journal of Statistical Planning and Inference

Volumn 136, Issue 4, 2006, Pages 1410-1432

  Gillispie, Steven B ^a  

^a UNIVERSITY OF WASHINGTON SCHOOL OF MEDICINE   (United States)

Author keywords

Acyclic digraph; ADG; Bayesian network; Chordal graph; Count; Dag; Equivalence class; Essential graph; GMM; Graphical Markov model

Indexed keywords

EID: 29444434689     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jspi.2004.10.007     Document Type: Article

References (19)

1. S.A. Andersson D. Madigan M.D. Perlman A characterization of Markov equivalence classes for acyclic digraphs Ann. Statist. 25 1997 505-541
2. J.R.S. Blair B. Peyton An introduction to chordal graphs and clique trees In: A. George J.R. Gilbert J.W.H. Liu (Eds.), Graph Theory and Sparse Matrix Computation 1993 Springer New York
3. A. Cayley A theorem on trees Quart. J. Math. 23 1889 376-378
4. Chickering, D.M., 1995. A transformational characterization of equivalent Bayesian network structures. In: Uncertainty in Artificial Intelligence: Proceedings of the Eleventh Conference. Morgan Kaufmann, San Francisco, pp. 87-98.
5. D.M. Chickering Learning equivalence classes of Bayesian-network structures J. Mach. Learn. Res. 2 2002 445-498
6. G.A. Dirac On rigid circuit graphs Abh. Math. Sem. Univ. Hamburg 25 1961 71-76
7. Gillispie, S., Perlman, M., 2001. Enumerating markov equivalence classes of acyclic digraph models. In: Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference. Morgan Kaufmann, San Francisco, pp. 171-177.
8. S.B. Gillispie M.D. Perlman The size distribution for Markov equivalence classes of acyclic digraph models Artif. Intell. 141 2002 137-155
9. Golumbic, M.C., 1980. Algorithmic Theory and Perfect Graphs. Academic Press, New York, p. 83.
10. Heckerman, D., Geiger, D., Chickering, D.M., 1994. Learning Bayesian networks: The combination of knowledge and statistical data. In: Uncertainty in Artificial Intelligence: Proceedings of the Tenth Conference. Morgan Kaufmann, San Francisco, pp. 293-301.
11. Kočka, T. (Aalborg University, Denmark), Personal communications.
12. J.W. Moon Counting labelled Trees 1970 Prentice-Hall Englewood Cliffs, NJ
13. Roberts, F.S., 1984. Applied combinatorics, Prentice-Hall, Englewood Cliffs, NJ, p. 254.
14. Robinson, R.W., 1973. Counting labeled acyclic digraphs. In: Harary, F. (Ed.), New Directions in the Theory of Graphs: Proceedings of the Third Ann Arbor Conference on Graph Theory, 1971. Academic Press, New York, pp. 239-273.
15. Robinson, R.W., 1977. Counting unlabeled acyclic digraphs. In: Little, C.H.C. (Ed.), Proceedings of the Fifth Australian Conference on Combinatorial Mathematics. Springer, Berlin, pp. 28-43.
16. B. Steinsky Enumeration of labeled chain graphs and labeled essential directed acyclic graphs Discrete Math. 270 2003 267-278
17. Verma, T., Pearl, J., 1990. Equivalence and synthesis of causal models. In: Uncertainty in Artificial Intelligence: Proceedings of the Sixth Conference. Morgan Kaufmann, San Francisco, pp. 220-227.
18. Verma, T., Pearl, J., 1992. An algorithm for deciding if a set of observed independencies has a causal explanation. In: Uncertainty in Artificial Intelligence: Proceedings of the Eighth Conference. Morgan Kaufmann, San Francisco, pp. 323-330.
19. M. Volf M. Studený A graphical characterization of the largest chain graphs Intl. J. Approx. Reason. 20 1999 209-236