Every LWF and AMP chain graph originates from a set of causal models

12/10/2013
by   Jose M. Peña, et al.
0

This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This implies that the independence model represented by the chain graph can be accounted for by a set of causal models that are subject to selection bias, which in turn can be accounted for by a system that switches between different regimes or configurations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2013

Marginal AMP Chain Graphs

We present a new family of models that is based on graphs that may have ...
research
09/25/2011

Towards Optimal Learning of Chain Graphs

In this paper, we extend Meek's conjecture (Meek 1997) from directed and...
research
06/28/2013

Error AMP Chain Graphs

Any regular Gaussian probability distribution that can be represented by...
research
12/04/2016

Representing Independence Models with Elementary Triplets

In an independence model, the triplets that represent conditional indepe...
research
08/02/2015

Learning from Pairwise Marginal Independencies

We consider graphs that represent pairwise marginal independencies among...
research
03/09/2018

The evolution of the global Markov property for multivariate regression graphs: differences and conflicts

Depending on the interpretation of the type of edges, a chain graph can ...
research
06/22/2023

Inferring the finest pattern of mutual independence from data

For a random variable X, we are interested in the blind extraction of it...

Please sign up or login with your details

Forgot password? Click here to reset