PC algorithm for nonparanormal graphical models
Open accessThe DOI matches its OpenAlex record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The PC algorithm uses conditional independence tests for model selection in graphical modeling with acyclic directed graphs. In Gaussian models, tests of conditional independence are typically based on Pearson correlations, and high-dimensional consistency results have been obtained for the PC algorithm in this setting. Analyzing the error propagation from marginal to partial correlations, we prove that high-dimensional consistency carries over to a broader class of Gaussian copula or nonparanormal models when using rank-based measures of correlation. For graph sequences with bounded degree, our consistency result is as strong as prior Gaussian results. In simulations, the ‘Rank PC’ algorithm works as well as the ‘Pearson PC’ algorithm for normal data and considerably better for non-normal data, all the while incurring a negligible increase of computation time. While our interest is in the PC algorithm, the presented analysis of error propagation could be applied to other algorithms that test the vanishing of low-order partial correlations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Causality: Models, Reasoning, and Inference
Pearl, J. (2009) · doi:10.1017/cbo9780511803161 · Cited by 11,653
The landscape of genetic complexity across 5,700 gene expression traits in yeast
Brem, R. B., & Kruglyak, L. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0408709102 · Cited by 603 · cited 2×
“We illustrate this for data on gene expression in yeast from Brem and Kruglyak (2005), where we focus on p = 54 genes from the MAPK signaling pathway as was done in Sun and Li (2012).”
MethodA characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425 · cited 3×
“Two DAGsG andH satisfyC(G) =C(H) if and only if [G] = [H], making the CPDAG a useful graphical representation of a Markov equivalence class; see Andersson et al. (1997) and Chickering (2002).”
BackgroundLearning high-dimensional directed acyclic graphs with latent and selection variables
Colombo, D., Maathuis, M. H., Kalisch, M., & Richardson, T. S. (2012) · The Annals of Statistics · doi:10.1214/11-aos940 · Cited by 384
Predicting causal effects in large-scale systems from observational data
Maathuis, M. H., Colombo, D., Kalisch, M., & Bühlmann, P. (2010) · Nature Methods · doi:10.1038/nmeth0410-247 · Cited by 217 · cited 2×
“PC algorithm can be found in Maathuis et al. (2010), Schmidberger et al. (2011), Le et al. (2013), and Verdugo et al. (2013).”
Method
Cited by
Order-independent constraint-based causal structure learning
Colombo, D., & Maathuis, M. H. (2014) · arXiv (Cornell University) · doi:10.5555/2627435.2750365 · Cited by 439
D’ya Like DAGs? A Survey on Structure Learning and Causal Discovery
Vowels, M. J., Camgoz, N. C., & Bowden, R. (2023) · ACM Computing Surveys · doi:10.1145/3527154 · Cited by 237
“PC [223] 1993 constraint yes yes yes no CPDAG CCD [196] 1996 constraint yes yes both no PAG FCI [223] 2000 constraint no yes yes no PAG TPDA [31] 2002 constraint yes yes yes no CPDAG CPC [190] 2006 constraint yes relaxed yes no CPDAG KCL [227] 2007 constraint yes yes yes no CPDAG ION [234] 2008 constraint no yes yes n…”
Methods for causal inference from gene perturbation experiments and validation
Meinshausen, N., Hauser, A., Mooij, J. M., Peters, J., Versteeg, P., & Bühlmann, P. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1510493113 · Cited by 140
Mining causality of network events in log data
Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2017.2778096 · Cited by 63
Metadata
- Authors
- Harris, N., & Drton, M.
- Venue
- mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich)
- Publisher
- Technical University of Munich
- Published
- 2013-01-01
- Volume
- 14
- Issue
- 1
- Pages
- 3365-3383
- DOI
- 10.5555/2567709.2567770
- OpenAlex
- W2168652321
- Cited by
- 101
- References
- 5
- FWCI
- 8.10
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PC algorithm for nonparanormal graphical models. https://app.cochat.ai/papers/10.5555/2567709.2567770
- The paper
- Harris, N., & Drton, M. (2013). PC algorithm for nonparanormal graphical models. mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich). https://doi.org/10.5555/2567709.2567770
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.