189 citations · 846 across the 31 of their papers we have counts for
5 papers · 1 filter
The m-connecting imset and factorization for ADMG models
Bryan Andrews, Gregory F. Cooper, Thomas S. Richardson +1
Directed acyclic graph (DAG) models have become widely studied and applied in statistics and machine learning -- indeed, their simplicity facilitates efficient procedures for learn…
A Uniformly Consistent Estimator of non-Gaussian Causal Effects Under the k-Triangle-Faithfulness Assumption
Shuyan Wang, Peter Spirtes
Kalisch and Bühlmann (2007) showed that for linear Gaussian models, under the Causal Markov Assumption, the Strong Causal Faithfulness Assumption, and the assumption of causal suff…
Estimating and Controlling the False Discovery Rate for the PC Algorithm Using Edge-Specific P-Values
Eric V. Strobl, Peter L. Spirtes, Shyam Visweswaran
The PC algorithm allows investigators to estimate a complete partially directed acyclic graph (CPDAG) from a finite dataset, but few groups have investigated strategies for estimat…
Causal discovery of linear acyclic models with arbitrary distributions
Patrik O. Hoyer, Aapo Hyvarinen, Richard Scheines +4
An important task in data analysis is the discovery of causal relationships between observed variables. For continuous-valued data, linear acyclic causal models are commonly used t…
Supplementary material for Markov equivalence for ancestral graphs
R. A. Ali, T. Richardson, P. Spirtes
We prove that the criterion for Markov equivalence provided by Zhao et al. (2005) may involve a set of features of a graph that is exponential in the number of vertices.