Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement

07/04/2012
by   Jin Tian, et al.
0

Maximal ancestral graphs (MAGs) are used to encode conditional independence relations in DAG models with hidden variables. Different MAGs may represent the same set of conditional independences and are called Markov equivalent. This paper considers MAGs without undirected edges and shows conditions under which an arrow in a MAG can be reversed or interchanged with a bi-directed edge so as to yield a Markov equivalent MAG.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/12/2012

Markov Equivalence Classes for Maximal Ancestral Graphs

Ancestral graphs are a class of graphs that encode conditional independe...
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
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
06/23/2016

On Gaussian Markov models for conditional independence

Markov models lie at the interface between statistical independence in a...
research
07/05/2020

Faster algorithms for Markov equivalence

Maximal ancestral graphs (MAGs) have many desirable properties; in parti...
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...

Please sign up or login with your details

Forgot password? Click here to reset