Reading Dependencies from Covariance Graphs

10/21/2010
by   Jose M. Peña, et al.
0

The covariance graph (aka bi-directed graph) of a probability distribution p is the undirected graph G where two nodes are adjacent iff their corresponding random variables are marginally dependent in p. In this paper, we present a graphical criterion for reading dependencies from G, under the assumption that p satisfies the graphoid properties as well as weak transitivity and composition. We prove that the graphical criterion is sound and complete in certain sense. We argue that our assumptions are not too restrictive. For instance, all the regular Gaussian probability distributions satisfy them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2012

Reading Dependencies from Polytree-Like Bayesian Networks

We present a graphical criterion for reading dependencies from the minim...
research
03/27/2013

Causal Networks: Semantics and Expressiveness

Dependency knowledge of the form "x is independent of y once z is known"...
research
03/04/2013

Learning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness: Extended Version

This paper deals with chain graphs under the Andersson-Madigan-Perlman (...
research
01/23/2013

Parameter Priors for Directed Acyclic Graphical Models and the Characterization of Several Probability Distributions

We show that the only parameter prior for complete Gaussian DAG models t...
research
04/17/2013

A Junction Tree Framework for Undirected Graphical Model Selection

An undirected graphical model is a joint probability distribution define...
research
10/08/2016

Indirect Gaussian Graph Learning beyond Gaussianity

This paper studies how to capture dependency graph structures from real ...
research
08/20/2020

Variance and covariance of distributions on graphs

We develop a theory to measure the variance and covariance of probabilit...

Please sign up or login with your details

Forgot password? Click here to reset