DeepAI AI Chat
Log In Sign Up

Markov Equivalence Classes for Maximal Ancestral Graphs

by   Ayesha R. Ali, et al.

Ancestral graphs are a class of graphs that encode conditional independence relations arising in DAG models with latent and selection variables, corresponding to marginalization and conditioning. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We introduce a simple representation of a Markov equivalence class of ancestral graphs, thereby facilitating model search. More specifically, we define a join operation on ancestral graphs which will associate a unique graph with a Markov equivalence class. We also extend the separation criterion for ancestral graphs (which is an extension of d-separation) and provide a proof of the pairwise Markov property for joined ancestral graphs.


page 1

page 2

page 3

page 4


Markov Equivalences for Subclasses of Loopless Mixed Graphs

In this paper we discuss four problems regarding Markov equivalences for...

Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement

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

Towards standard imsets for maximal ancestral graphs

The imsets of <cit.> are an algebraic method for representing conditiona...

Markov equivalence of marginalized local independence graphs

Symmetric independence relations are often studied using graphical repre...

Stable mixed graphs

In this paper, we study classes of graphs with three types of edges that...

Marginalization and Conditioning for LWF Chain Graphs

In this paper, we deal with the problem of marginalization over and cond...

Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables

It is well known that there may be many causal explanations that are con...