Markov Properties for Acyclic Directed Mixed Graphs

Thomas S. Richardson · Scandinavian Journal of Statistics · 2003

We consider acyclic directed mixed graphs, in which directed edges (x→y) and bi‐directed edges (x↔y) may occur. A simple extension of Pearl'sd‐separation criterion, calledm‐separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from them‐separation criterion for arbitrary distributions.

Read the paper · More papers on PaperTik