Publication | Closed Access
Markov Properties for Acyclic Directed Mixed Graphs
197
Citations
9
References
2003
Year
Directed GraphNetwork ScienceGraph TheoryEngineeringRandom GraphProbabilistic Graph TheoryGlobal PropertyNetwork AnalysisEducationLocal Markov PropertyMarkov PropertiesMixed GraphsProbability TheoryDiscrete MathematicsCombinatorial Optimization
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's d ‐separation criterion, called m ‐separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m ‐separation criterion for arbitrary distributions.
| Year | Citations | |
|---|---|---|
Page 1
Page 1