Separators and Adjustment Sets in Markov Equivalent DAGs

In practice the vast majority of causal effect estimations from observational data are computed using adjustment sets which avoid confounding by adjusting for appropriate covariates. Recently several graphical criteria for selecting adjustment sets have been proposed. They handle causal directed acyclic graphs (DAGs) as well as more general types of graphs that represent Markov equivalence classes of DAGs, including completed partially directed acyclic graphs (CPDAGs). Though expressed in graphical language, it is not obvious how the criteria can be used to obtain effective algorithms for finding adjustment sets. In this paper we provide a new criterion which leads to an efficient algorithmic framework to find, test and enumerate covariate adjustments for chain graphs – mixed graphs representing in a compact way a broad range of Markov equivalence classes of DAGs.

[1]  James M. Robins,et al.  On the Validity of Covariate Adjustment for Estimating Causal Effects , 2010, UAI.

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

[3]  Jiji Zhang,et al.  Causal Reasoning with Ancestral Graphs , 2008, J. Mach. Learn. Res..

[4]  Milan Studený,et al.  Chain graphs: semantics and expressiveness , 1995, ECSQARU.

[5]  J. Pearl.  Causal diagrams for empirical research , 1995 .

[6]  Luis M. de Campos,et al.  An Algorithm for Finding Minimum d-Separating Sets in Belief Networks , 1996, UAI.

[7]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

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

[9]  David Maxwell Chickering,et al.  Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.

[10]  Ross D. Shachter.  Bayes-Ball: The Rational Pastime (for Determining Irrelevance and Requisite Information in Belief Networks and Influence Diagrams) , 1998, UAI.

[11]  Maciej Liskiewicz,et al.  Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective , 2011, UAI.

[12]  Illtyd Trethowan.  Causality , 1938 .

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

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

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

[16]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

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

[18]  Maciej Liskiewicz,et al.  Constructing Separators and Adjustment Sets in Ancestral Graphs , 2014, CI@UAI.

[19]  David Maxwell Chickering,et al.  A Transformational Characterization of Equivalent Bayesian Network Structures , 1995, UAI.

[20]  Ken Takata,et al.  Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph , 2010, Discret. Appl. Math..

[21]  Judea Pearl,et al.  An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation , 1992, UAI.

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

[23]  Johannes Textor,et al.  A Complete Generalized Adjustment Criterion , 2015, UAI.