Markov Properties for Loopless Mixed Graphs

Details Markov Properties for Loopless Mixed Graphs Markov Properties for Loopless Mixed Graphs

2011-09-27

arxiv.org/abs/1109.5909v1

Statistics

Other Statistics

18 pages, 7 figures

Scientific paper

In this paper we unify the Markov theory of a variety of different types of graphs used in graphical Markov models by introducing the class of loopless mixed graphs (LMG), and show that all of the corresponding independence models induced by $m$-separation are compositional graphoids. Special cases include undirected graphs, bidirected graphs, and directed acyclic graphs, as well as maximal ancestral graphs. We define maximality of such graphs as well as a pairwise and a global Markov property. We prove for a maximal LMG that the global and pairwise Markov properties are equivalent for any independence model which is a compositional graphoid.

Affiliated with

Also associated with

No associations

Rating

Markov Properties for Loopless Mixed Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Markov Properties for Loopless Mixed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Markov Properties for Loopless Mixed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63056