Global Markov property of a directed acyclic graph
= Global Markov property of a directed acyclic graph
The global Markov property of a <Directed acyclic graph> says that d-separation of vertex sets $A$ and $B$ by $S$ implies conditional independence of the corresponding random vectors given the variables at $S$.