{"paper":{"title":"Using the structure of d-connecting paths as a qualitative measure of the strength of dependence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sanjay Chaudhari, Thomas S. Richardson","submitted_at":"2012-10-19T15:04:23Z","abstract_excerpt":"Pearls concept OF a d - connecting path IS one OF the foundations      OF the modern theory OF graphical models : the absence OF a d      - connecting path IN a DAG indicates that conditional independence      will hold IN ANY distribution factorising according TO that graph.      IN this paper we show that IN singly - connected Gaussian DAGs      it IS possible TO USE the form OF a d - connection TO obtain qualitative      information about the strength OF conditional dependence.More      precisely, the squared partial correlations BETWEEN     two given variables, conditioned ON     different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2469","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"}