Local Markov Property for Models Satisfying Composition Axiom

07/04/2012
by   Changsung Kang, et al.
0

The local Markov condition for a DAG to be an independence map of a probability distribution is well known. For DAGs with latent variables, represented as bi-directed edges in the graph, the local Markov property may invoke exponential number of conditional independencies. This paper shows that the number of conditional independence relations required may be reduced if the probability distributions satisfy the composition axiom. In certain types of graphs, only linear number of conditional independencies are required. The result has applications in testing linear structural equation models with correlated errors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2012

Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement

Maximal ancestral graphs (MAGs) are used to encode conditional independe...
research
07/04/2012

A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent Variables

Different directed acyclic graphs (DAGs) may be Markov equivalent in the...
research
11/12/2018

Markov Property in Generative Classifiers

We show that, for generative classifiers, conditional independence corre...
research
06/28/2013

Error AMP Chain Graphs

Any regular Gaussian probability distribution that can be represented by...
research
05/16/2022

Selfadhesivity in Gaussian conditional independence structures

Selfadhesivity is a property of entropic polymatroids which can be formu...
research
05/11/2007

Determining full conditional independence by low-order conditioning

A concentration graph associated with a random vector is an undirected g...
research
06/23/2016

On Gaussian Markov models for conditional independence

Markov models lie at the interface between statistical independence in a...

Please sign up or login with your details

Forgot password? Click here to reset