DeepAI AI Chat
Log In Sign Up

Stable mixed graphs

by   Kayvan Sadeghi, et al.
University of Oxford

In this paper, we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables using the m-separation criterion. These include MC, summary, and ancestral graphs. As a modification of MC graphs, we define the class of ribbonless graphs (RGs) that permits the use of the m-separation criterion. RGs contain summary and ancestral graphs as subclasses, and each RG can be generated by a DAG after marginalisation and conditioning. We derive simple algorithms to generate RGs, from given DAGs or RGs, and also to generate summary and ancestral graphs in a simple way by further extension of the RG-generating algorithm. This enables us to develop a parallel theory on these three classes and to study the relationships between them as well as the use of each class.


page 1

page 2

page 3

page 4


Marginalization and Conditioning for LWF Chain Graphs

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

Markov Equivalence Classes for Maximal Ancestral Graphs

Ancestral graphs are a class of graphs that encode conditional independe...

Markov properties for mixed graphs

In this paper, we unify the Markov theory of a variety of different type...

Conditional Separation as a Binary Relation

Pearl's d-separation is a foundational notion to study conditional indep...

The Global Markov Property for a Mixture of DAGs

Real causal processes may contain feedback loops and change over time. I...

An Algorithm for Finding Minimum d-Separating Sets in Belief Networks

The criterion commonly used in directed acyclic graphs (dags) for testin...

Identifying Independencies in Causal Graphs with Feedback

We show that the d -separation criterion constitutes a valid test for co...