A generalized back-door criterion

From MaRDI portal
Publication:2352735

DOI10.1214/14-AOS1295zbMATH Open1320.62157arXiv1307.5636WikidataQ57707403 ScholiaQ57707403MaRDI QIDQ2352735FDOQ2352735

Diego Colombo, Marloes H. Maathuis

Publication date: 6 July 2015

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: We generalize Pearl's back-door criterion for directed acyclic graphs (DAGs) to more general types of graphs that describe Markov equivalence classes of DAGs and/or allow for arbitrarily many hidden variables. We also give easily checkable necessary and sufficient graphical criteria for the existence of a set of variables that satisfies our generalized back-door criterion, when considering a single intervention and a single outcome variable. Moreover, if such a set exists, we provide an explicit set that fulfills the criterion. We illustrate the results in several examples. R-code is available in the R-package pcalg.


Full work available at URL: https://arxiv.org/abs/1307.5636





Cites Work


Cited In (11)

Uses Software


   Recommendations





This page was built for publication: A generalized back-door criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352735)