Global Markov property for an undirected graph
= Global Markov property for an undirected graph
The global <Markov property> says that <graph> separation of vertex sets $A$ and $B$ by $S$ implies <conditional independence> of the corresponding <random vectors> given the variables at $S$.