{"paper":{"title":"PenPC: A Two-step Approach to Estimate the Skeletons of High Dimensional Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Jichun Xie, Min Jin Ha, Wei Sun","submitted_at":"2014-05-07T13:37:00Z","abstract_excerpt":"Estimation of the skeleton of a directed acyclic graph (DAG) is of great importance for understanding the underlying DAG and causaleffects can be assessed from the skeleton when the DAG is notidentifiable. We propose a novel method named PenPC toestimate the skeleton of a high-dimensional DAG by a two-stepapproach. We first estimate the non-zero entries of a concentrationmatrix using penalized regression, and then fix the differencebetween the concentration matrix and the skeleton by evaluating aset of conditional independence hypotheses. For high dimensionalproblems where the number of vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1603","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}