Using the structure of d-connecting paths as a qualitative measure of the strength of dependence

10/19/2012
by   Sanjay Chaudhari, et al.
0

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 subsets may be partially ordered BY examining the relationship BETWEEN the d - connecting path AND the SET OF variables conditioned upon.

READ FULL TEXT
research
03/12/2015

Qualitative inequalities for squared partial correlations of a Gaussian random vector

We describe various sets of conditional independence relationships, suff...
research
09/20/2019

The Locally Gaussian Partial Correlation

It is well known that the dependence structure for jointly Gaussian vari...
research
04/28/2020

Dependence in elliptical partial correlation graphs

The Gaussian model is equipped with strong properties that facilitate st...
research
07/12/2019

Path Weights in Concentration Graphs

A graphical model provides a compact and efficient representation of the...
research
12/11/2019

Graph quilting: graphical model selection from partially observed covariances

We investigate the problem of conditional dependence graph estimation wh...
research
06/21/2021

Nonparametric causal structure learning in high dimensions

The PC and FCI algorithms are popular constraint-based methods for learn...
research
08/10/2023

Knowledge Propagation over Conditional Independence Graphs

Conditional Independence (CI) graph is a special type of a Probabilistic...

Please sign up or login with your details

Forgot password? Click here to reset