257 citations · 356 across the 3 of their papers we have counts for
Showing stat.MEShow all
2 papers · 1 filter
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.ME2011★ 257 cited
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…