Log In Sign Up

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

by   Sanjay Chaudhari, et al.

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.


Qualitative inequalities for squared partial correlations of a Gaussian random vector

We describe various sets of conditional independence relationships, suff...

The Locally Gaussian Partial Correlation

It is well known that the dependence structure for jointly Gaussian vari...

Dependence in elliptical partial correlation graphs

The Gaussian model is equipped with strong properties that facilitate st...

Path Weights in Concentration Graphs

A graphical model provides a compact and efficient representation of the...

Graph quilting: graphical model selection from partially observed covariances

We investigate the problem of conditional dependence graph estimation wh...

Approximate Implication with d-Separation

The graphical structure of Probabilistic Graphical Models (PGMs) encodes...

The Geometry of Gaussoids

A gaussoid is a combinatorial structure that encodes independence in pro...