Error AMP Chain Graphs

06/28/2013
by   Jose M. Peña, et al.
0

Any regular Gaussian probability distribution that can be represented by an AMP chain graph (CG) can be expressed as a system of linear equations with correlated errors whose structure depends on the CG. However, the CG represents the errors implicitly, as no nodes in the CG correspond to the errors. We propose in this paper to add some deterministic nodes to the CG in order to represent the errors explicitly. We call the result an EAMP CG. We will show that, as desired, every AMP CG is Markov equivalent to its corresponding EAMP CG under marginalization of the error nodes. We will also show that every EAMP CG under marginalization of the error nodes is Markov equivalent to some LWF CG under marginalization of the error nodes, and that the latter is Markov equivalent to some directed and acyclic graph (DAG) under marginalization of the error nodes and conditioning on some selection nodes. This is important because it implies that the independence model represented by an AMP CG can be accounted for by some data generating process that is partially observed and has selection bias. Finally, we will show that EAMP CGs are closed under marginalization. This is a desirable feature because it guarantees parsimonious models under marginalization.

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
12/10/2013

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

This paper aims at justifying LWF and AMP chain graphs by showing that t...
research
07/04/2012

Local Markov Property for Models Satisfying Composition Axiom

The local Markov condition for a DAG to be an independence map of a prob...
research
11/18/2015

Alternative Markov and Causal Properties for Acyclic Directed Mixed Graphs

We extend Andersson-Madigan-Perlman chain graphs by (i) relaxing the sem...
research
06/21/2018

Identifiability of Gaussian Structural Equation Models with Dependent Errors Having Equal Variances

In this paper, we prove that some Gaussian structural equation models wi...
research
06/23/2016

On Gaussian Markov models for conditional independence

Markov models lie at the interface between statistical independence in a...
research
07/04/2012

Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement

Maximal ancestral graphs (MAGs) are used to encode conditional independe...

Please sign up or login with your details

Forgot password? Click here to reset