Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
From MaRDI portal
Publication:4558558
zbMATH Open1473.62199arXiv1606.06903MaRDI QIDQ4558558FDOQ4558558
Authors: Emilija Perković, Johannes Textor, Markus Kalisch, Marloes H. Maathuis 
Publication date: 22 November 2018
Abstract: We present a graphical criterion for covariate adjustment that is sound and complete for four different classes of causal graphical models: directed acyclic graphs (DAGs), maximum ancestral graphs (MAGs), completed partially directed acyclic graphs (CPDAGs), and partial ancestral graphs (PAGs). Our criterion unifies covariate adjustment for a large set of graph classes. Moreover, we define an explicit set that satisfies our criterion, if there is any set that satisfies our criterion. We also give efficient algorithms for constructing all sets that fulfill our criterion, implemented in the R package dagitty. Finally, we discuss the relationship between our criterion and other criteria for adjustment, and we provide new soundness and completeness proofs for the adjustment criterion for DAGs.
Full work available at URL: https://arxiv.org/abs/1606.06903
Recommendations
Cites Work
- Order-independent constraint-based causal structure learning
- Causation, prediction, and search
- A new approach to causal inference in mortality studies with a sustained exposure period—application to control of the healthy worker survivor effect
- On the Role of the Propensity Score in Efficient Semiparametric Estimation of Average Treatment Effects
- Causality. Models, reasoning, and inference
- Estimating high-dimensional intervention effects from observational data
- Ancestral graph Markov models.
- Estimating the effect of joint interventions from observational data in sparse high-dimensional settings
- A new criterion for confounder selection
- Confounding and collapsibility in causal inference
- External validity: from do-calculus to transportability across populations
- Markov Properties for Acyclic Directed Mixed Graphs
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Marginalizing and conditioning in graphical models
- Title not available (Why is that?)
- 10.1162/153244303321897717
- Markov equivalence for ancestral graphs
- Covariate Selection for Estimating the Causal Effect of Control Plans by Using Causal Diagrams
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Causal reasoning with ancestral graphs
- Independence properties of directed markov fields
- Covariate selection for the nonparametric estimation of an average treatment effect
- Estimating bounds on causal effects in high-dimensional and possibly confounded systems
- High-dimensional consistency in score-based and hybrid structure learning
- A generalized back-door criterion
Cited In (6)
- Sound and complete causal identification with latent variables given local background knowledge
- On the Markov equivalence of maximal ancestral graphs
- Characterization of causal ancestral graphs for time series with latent confounders
- Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
- dagitty
- Corrigendum to: ``Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
Uses Software
This page was built for publication: Complete graphical characterization and construction of adjustment sets in Markov equivalence classes of ancestral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558558)
