PC algorithm for nonparanormal graphical models

From MaRDI portal
Publication:2933951

zbMATH Open1318.62197arXiv1207.0242MaRDI QIDQ2933951FDOQ2933951


Authors: Naftali Harris, Mathias Drton Edit this on Wikidata


Publication date: 8 December 2014

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. We prove that high-dimensional consistency carries over to the broader class of Gaussian copula or extit{nonparanormal} models when using rank-based measures of correlation. For graphs with bounded degree, our 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 Gaussian copula data, all the while incurring a negligible increase of computation time. Simulations with contaminated data show that rank correlations can also perform better than other robust estimates considered in previous work when the underlying distribution does not belong to the nonparanormal family.


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




Recommendations





Cited In (35)





This page was built for publication: PC algorithm for nonparanormal graphical models

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