Counting and Sampling from Markov Equivalent DAGs Using Clique Trees

A directed acyclic graph (DAG) is the most common graphical model for representing causal relationships among a set of variables. When restricted to using only observational data, the structure of the ground truth DAG is identifiable only up to Markov equivalence, based on conditional independence relations among the variables. Therefore, the number of DAGs equivalent to the ground truth DAG is an indicator of the causal complexity of the underlying structure--roughly speaking, it shows how many interventions or how much additional information is further needed to recover the underlying DAG. In this paper, we propose a new technique for counting the number of DAGs in a Markov equivalence class. Our approach is based on the clique tree representation of chordal graphs. We show that in the case of bounded degree graphs, the proposed algorithm is polynomial time. We further demonstrate that this technique can be utilized for uniform sampling from a Markov equivalence class, which provides a stochastic way to enumerate DAGs in the equivalence class and may be needed for finding the best DAG or for causal inference given the equivalence class as input. We also extend our counting and sampling method to the case where prior knowledge about the underlying DAG is available, and present applications of this extension in causal experiment design and estimating the causal effect of joint interventions.

[1]  Prasad Tetali,et al.  On sampling graphical Markov models , 2017 .

[2]  Frederick Eberhardt,et al.  On the Number of Experiments Sufficient and in the Worst Case Necessary to Identify All Causal Relations Among N Variables , 2005, UAI.

[3]  Peter Bühlmann,et al.  Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs (Abstract) , 2011, UAI.

[4]  Marloes H. Maathuis,et al.  Interpreting and Using CPDAGs With Background Knowledge , 2017, UAI.

[5]  Yuhao Wang,et al.  Permutation-based Causal Inference Algorithms with Interventions , 2017, NIPS.

[6]  P. Spirtes,et al.  Causation, prediction, and search , 1993 .

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

[8]  Bin Yu,et al.  Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs , 2015, J. Mach. Learn. Res..

[9]  M. Maathuis,et al.  Estimating the effect of joint interventions from observational data in sparse high-dimensional settings , 2014, 1407.2451.

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

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

[12]  Yangbo He,et al.  Active Learning of Causal Networks with Intervention Experiments and Optimal Designs , 2008 .

[13]  Patrik O. Hoyer,et al.  Bayesian Discovery of Linear Acyclic Causal Models , 2009, UAI.

[14]  M. Maathuis,et al.  Estimating high-dimensional intervention effects from observational data , 2008, 0810.4214.

[15]  Martin S. Andersen,et al.  Chordal Graphs and Semidefinite Optimization , 2015, Found. Trends Optim..

[16]  David Maxwell Chickering,et al.  Optimal Structure Identification With Greedy Search , 2002, J. Mach. Learn. Res..

[17]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[18]  Bernhard Schölkopf,et al.  Elements of Causal Inference: Foundations and Learning Algorithms , 2017 .

[19]  R Scheines,et al.  The TETRAD Project: Constraint Based Aids to Causal Model Specification. , 1998, Multivariate behavioral research.

[20]  Aapo Hyvärinen,et al.  Causal discovery of linear acyclic models with arbitrary distributions , 2008, UAI.

[21]  Bin Yu,et al.  Formulas for Counting the Sizes of Markov Equivalence Classes of Directed Acyclic Graphs , 2016, ArXiv.

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

[23]  Peter Buhlmann,et al.  Causal inference in partially linear structural equation models , 2016, The Annals of Statistics.

[24]  Elias Bareinboim,et al.  Budgeted Experiment Design for Causal Structure Learning , 2017, ICML.

[25]  K. Sachs,et al.  Causal Protein-Signaling Networks Derived from Multiparameter Single-Cell Data , 2005, Science.

[26]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[27]  Bertran Steinsky,et al.  Enumeration of Labelled Essential Graphs , 2013, Ars Comb..

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

[29]  Preetam Nandy,et al.  Structure Learning of Linear Gaussian Structural Equation Models with Weak Edges , 2017, UAI.