A note on global Markov properties for mixed graphs
Michael Eichler
TL;DR
This paper introduces a new, easily implementable characterization of global Markov properties in mixed graphs, offering an alternative to existing path-based and augmented graph methods.
Contribution
It provides a novel, practical approach to understanding global Markov properties in mixed graphs, simplifying their implementation.
Findings
New characterization of global Markov properties
Simplified implementation method
Comparable accuracy to existing methods
Abstract
Global Markov properties in mixed graphs are usually formulated in terms of the path-oriented m-separation or by use of augmented graphs (similar to moral graphs in the case of directed acyclic graphs). We provide an alternative characterization that can be easily implemented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Complex Network Analysis Techniques