Markov equivalence for ancestral graphs

Details Markov equivalence for ancestral graphs Markov equivalence for ancestral graphs

2009-08-25

arxiv.org/abs/0908.3605v1

Annals of Statistics 2009, Vol. 37, No. 5B, 2808-2837

Mathematics

Statistics Theory

Published in at http://dx.doi.org/10.1214/08-AOS626 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of

Scientific paper

10.1214/08-AOS626

Ancestral graphs can encode conditional independence relations that arise in directed acyclic graph (DAG) models with latent and selection variables. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We state and prove conditions under which two maximal ancestral graphs are Markov equivalent to each other, thereby extending analogous results for DAGs given by other authors. These conditions lead to an algorithm for determining Markov equivalence that runs in time that is polynomial in the number of vertices in the graph.

Affiliated with

Also associated with

No associations

Rating

Markov equivalence for ancestral graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Markov equivalence for ancestral graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Markov equivalence for ancestral graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233284