Markov equivalence of directed acyclic graphs
= Markov equivalence of directed acyclic graphs
{c}
= Markov equivalent directed acyclic graphs
{c}
{synonym}
Two <Directed acyclic graphs> are Markov equivalent when they encode the same <D-separations> for all disjoint sets of vertices. They consequently impose the same <global Markov property for a directed acyclic graph>, although their causal interpretations can differ.