88 citations · 99 across the 2 of their papers we have counts for
3 papers
stat.ME2013★ 88 cited
A generalized back-door criterion
Marloes H. Maathuis, Diego Colombo
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 arbit…
stat.ML2012★ 11 cited
Order-independent constraint-based causal structure learning
Diego Colombo, Marloes H. Maathuis
We consider constraint-based methods for causal structure learning, such as the PC-, FCI-, RFCI- and CCD- algorithms (Spirtes et al. (2000, 1993), Richardson (1996), Colombo et al.…
stat.ME2011
Learning high-dimensional directed acyclic graphs with latent and selection variables
Diego Colombo, Marloes H. Maathuis, Markus Kalisch +1
We consider the problem of learning causal information between random variables in directed acyclic graphs (DAGs) when allowing arbitrarily many latent and selection variables. The…