The Annals of Statistics
- Ann. Statist.
- Volume 46, Number 5 (2018), 2251-2278.
Unifying Markov properties for graphical models
Several types of graphs with different conditional independence interpretations—also known as Markov properties—have been proposed and used in graphical models. In this paper, we unify these Markov properties by introducing a class of graphs with four types of edges—lines, arrows, arcs and dotted lines—and a single separation criterion. We show that independence structures defined by this class specialize to each of the previously defined cases, when suitable subclasses of graphs are considered. In addition, we define a pairwise Markov property for the subclass of chain mixed graphs, which includes chain graphs with the LWF interpretation, as well as summary graphs (and consequently ancestral graphs). We prove the equivalence of this pairwise Markov property to the global Markov property for compositional graphoid independence models.
Ann. Statist., Volume 46, Number 5 (2018), 2251-2278.
Received: August 2016
Revised: July 2017
First available in Project Euclid: 17 August 2018
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
AMP Markov property $c$-separation chain graph compositional graphoid $d$-separation independence model LWF Markov property $m$-separation mixed graph pairwise Markov property regression chain Markov property
Lauritzen, Steffen; Sadeghi, Kayvan. Unifying Markov properties for graphical models. Ann. Statist. 46 (2018), no. 5, 2251--2278. doi:10.1214/17-AOS1618. https://projecteuclid.org/euclid.aos/1534492835