Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs

Annals of Statistics

Volumn 41, Issue 4, 2013, Pages 1742-1779

  He, Yangbo ^a   Jia, Jinzhu ^a   Yu, Bin ^b  

^a PEKING UNIVERSITY   (China)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Causal inference; Markov equivalence class; Reversible Markov chain; Sparse graphical model

Indexed keywords

EID: 84885027886     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/13-AOS1125     Document Type: Article

References (37)

1. ALDOUS, D. and FILL, J. Reversible Markov chains and random walks on graphs. Available at http://www.stat.berkeley.edu/~aldous/RWG/book.html.
2. ANDERSSON, S. A., MADIGAN, D. and PERLMAN, M. D. (1997). A characterization of Markov equivalence classes for acyclic digraphs. Ann. Statist. 25 505-541.
3. CASTELO, R. and PERLMAN, M. D. (2004). Learning essential graph Markov models from data. In Advances in Bayesian Networks. Studies in Fuzziness and Soft Computing 146 255-269.
4. CHICKERING, D., GEIGER, D. and HECKERMAN, D. (1995). Learning Bayesian networks: Search methods and experimental results. In Proceedings of Fifth Conference on Artificial Intelligence and Statistics 112-128.
5. CHICKERING, D. M. (1995). A transformational characterization of equivalent Bayesian network structures. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (Montreal, PQ, 1995) 87-98.
6. CHICKERING, D. M. (2002). Learning equivalence classes of Bayesian-network structures. J. Mach. Learn. Res. 2 445-498. (Pubitemid 135712569)
7. CHICKERING, D. M. (2003). Optimal structure identification with greedy search: Computational learning theory. J. Mach. Learn. Res. 3 507-554.
8. COOPER, G. F. and YOO, C. (1999). Causal discovery from a mixture of experimental and observational data. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence 116-125.
9. DASH, D. and DRUZDZEL, M. J. (1999). A hybrid anytime algorithm for the construction of causal models from sparse data. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence 142-149. Morgan Kaufmann, San Mateo, CA.
10. DOR, D. and TARSI, M. (1992). A simple algorithm to construct a consistent extension of a partially oriented graph. Technicial Report R-185, Cognitive Systems Laboratory, UCLA.
11. EBERHARDT, F. and SCHEINES, R. (2007). Interventions and causal inference. Philos. Sci. 74 981-995.
12. FINEGOLD, M. and DRTON, M. (2011). Robust graphical modeling of gene networks using classical and alternative t-distributions. Ann. Appl. Stat. 5 1057-1080.
13. FRIEDMAN, N. (2004). Inferring cellular networks using probabilistic graphical models. Science Signaling 303 799.
14. GILLISPIE, S. B. (2006). Formulas for counting acyclic digraph Markov equivalence classes. J. Statist. Plann. Inference 136 1410-1432. (Pubitemid 43009030)
15. GILLISPIE, S. B. and PERLMAN, M. D. (2002). The size distribution for Markov equivalence classes of acyclic digraph models. Artificial Intelligence 141 137-155.
16. HE, Y., JIA, J. and YU, B. (2013). Supplement to "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs.," DOI:10.1214/13-AOS1125SUPP.
17. HE, Y.-B. and GENG, Z. (2008). Active learning of causal networks with intervention experiments and optimal designs. J. Mach. Learn. Res. 9 2523-2547.
18. HECKERMAN, D., GEIGER, D. and CHICKERING, D. M. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning 20 197-243.
19. HECKERMAN, D., MEEK, C. and COOPER, G. (1999). A Bayesian approach to causal discovery. In Computation, Causation, and Discovery 141-165.
20. JANSEN, R., YU, H., GREENBAUM, D., KLUGER, Y., and KROGAN., N. J., CHUNG, S., EMILI, A., SNYDER, M., GREENBLATT, J. F. and GERSTEIN, M. (2003). A Bayesian networks approach for predicting protein-protein interactions from genomic data. Science 302 449.
21. KALISCH, M. and BUHLMANN, P. (2007). Estimating high-dimensional directed acyclic graphs with the pc-algorithm. J. Mach. Learn. Res. 8 613-636. (Pubitemid 46473523)
22. LAURITZEN, S. L. and RICHARDSON, T. S. (2002). Chain graph models and their causal interpretations. J. R. Stat. Soc. Ser. B Stat. Methodol. 64 321-361.
23. LOVASZ, L. (1993). Random walks on graphs: A survey. Combinatorics: Paul Erdo's Is Eighty 2 1-46.
24. MAATHUIS, M. H., KALISCH, M. and BÜHLMANN, P. (2009). Estimating high-dimensional intervention effects from observational data. Ann. Statist. 37 3133-3164.
25. MADIGAN, D., and ANDERSSON., S. A., PERLMAN, M. D. and VOLINSKY, C. T. (1996). Bayesian model averaging and model selection for Markov equivalence classes of acyclic digraphs. Comm. Statist. Theory Methods 25 2493-2519. (Pubitemid 126710973)
26. MEEK, C. (1995). Causal inference and causal explanation with background knowledge. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (San Mateo) 403-410.
27. MUNTEANU, P. and BENDOU, M. (2001). The eq framework for learning equivalence classes of Bayesian networks. In Proceedings IEEE International Conference on Data Mining, 2001. ICDM 2001 417-424.
28. NORRIS, J. R. (1997). Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics 2.
29. PEÑA, J. M. (2007). Approximate counting of graphical models via MCMC. In Proceedings of the 11th International Conference on Artificial Intelligence 352-359. San Juan, Puerto Rico; available at http://jmlr.org/ proceedings/papers/v2/pena07a/pena07a.pdf.
30. PEÑA, J. M. (2013). Approximate counting of graphical models via mcmc revisited. Preprint. Available at arXiv:1301.7189.
31. PEARL, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
32. PEARL, J. (2000). Causality: Models, Reasoning, and Inference. Cambridge Univ. Press, Cambridge.
33. PEARL, J. and VERMA, T. S. (1991). A theory of inferred causation. In Principles of Knowledge Representation and Reasoning (Cambridge, MA, 1991) 441-452.
34. PERLMAN, M. D. (2001). Graphical model search via essential graphs. In Algebraic Methods in Statistics and Probability (Notre Dame, IN, 2000). Contemporary Mathematics 287 255-265.
35. SPIRTES, P., GLYMOUR, C. N. and SCHEINES, R. (2001). Causation, Prediction, and Search. MIT Press, Cambridge.
36. VERMA, T. and PEARL, J. (1990). Equivalence and synthesis of causal models. In Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence 270.
37. VERMA, T. and PEARL, J. (1992). An algorithm for deciding if a set of observed independencies has a causal explanation. In Proceedings of the Eighth International Conference on Uncertainty in Artificial Intelligence 323-330. Morgan Kaufmann, San Mateo, CA.