• Bernoulli
  • Volume 19, Number 5B (2013), 2330-2358.

Stable mixed graphs

Kayvan Sadeghi

Full-text: Open access


In this paper, we study classes of graphs with three types of edges that capture the modified independence structure of a directed acyclic graph (DAG) after marginalisation over unobserved variables and conditioning on selection variables using the $m$-separation criterion. These include MC, summary, and ancestral graphs. As a modification of MC graphs, we define the class of ribbonless graphs (RGs) that permits the use of the $m$-separation criterion. RGs contain summary and ancestral graphs as subclasses, and each RG can be generated by a DAG after marginalisation and conditioning. We derive simple algorithms to generate RGs, from given DAGs or RGs, and also to generate summary and ancestral graphs in a simple way by further extension of the RG-generating algorithm. This enables us to develop a parallel theory on these three classes and to study the relationships between them as well as the use of each class.

Article information

Bernoulli, Volume 19, Number 5B (2013), 2330-2358.

First available in Project Euclid: 3 December 2013

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

ancestral graph directed acyclic graph independence model $m$-separation criterion marginalisation and conditioning MC graph summary graph


Sadeghi, Kayvan. Stable mixed graphs. Bernoulli 19 (2013), no. 5B, 2330--2358. doi:10.3150/12-BEJ454.

Export citation


  • [1] Cox, D.R. and Wermuth, N. (1993). Linear dependencies represented by chain graphs. Statist. Sci. 8 204–218, 247–283. With comments and a rejoinder by the authors.
  • [2] Cox, D.R. and Wermuth, N. (1996). Multivariate Dependencies: Models, Analysis and Interpretation. Monographs on Statistics and Applied Probability 67. London: Chapman & Hall.
  • [3] Drton, M. and Richardson, T. (2004). Iterative Conditional Fitting for Gaussian Ancestral Graph Models. In Proceedings of the Proceedings of the Twentieth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-04) 130–137. Arlington, VA: AUAI Press.
  • [4] Kiiveri, H., Speed, T.P. and Carlin, J.B. (1984). Recursive causal models. J. Austral. Math. Soc. Ser. A 36 30–52.
  • [5] Koster, J.T.A. (2002). Marginalizing and conditioning in graphical models. Bernoulli 8 817–840.
  • [6] Lauritzen, S.L. (1996). Graphical Models. Oxford Statistical Science Series 17. New York: Clarendon Press.
  • [7] Lauritzen, S.L., Dawid, A.P., Larsen, B.N. and Leimer, H.G. (1990). Independence properties of directed Markov fields. Networks 20 491–505.
  • [8] Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. The Morgan Kaufmann Series in Representation and Reasoning. San Mateo, CA: Morgan Kaufmann.
  • [9] Pearl, J. and Wermuth, N. (1994). When can association graphs admit a causal interpretation? Models and Data, Artificial Intelligence and Statistics 4 205–214.
  • [10] Richardson, T. and Spirtes, P. (2002). Ancestral graph Markov models. Ann. Statist. 30 962–1030.
  • [11] Sadeghi, K. (2012). Graphical representation of independence structures. Ph.D. thesis, Univ. Oxford.
  • [12] Studeny, M. (2005). Probabilistic Conditional Independence Structures. London, United Kingdom: Springer.
  • [13] Wermuth, N. (2011). Probability distributions with summary graph structure. Bernoulli 17 845–879.
  • [14] Wermuth, N. and Cox, D.R. (2004). Joint response graphs and separation induced by triangular systems. J. R. Stat. Soc. Ser. B Stat. Methodol. 66 687–717.
  • [15] Wermuth, N. and Cox, D.R. (2008). Distortion of effects caused by indirect confounding. Biometrika 95 17–33.
  • [16] Wermuth, N., Cox, D.R. and Pearl, J. (1994). Explanation for multivariate structures derived from univariate recursive regressions. Technical Report 94(1), Univ. Mainz, Germany.
  • [17] Wermuth, N., Wiedenbeck, M. and Cox, D.R. (2006). Partial inversion for linear systems and partial closure of independence graphs. BIT 46 883–901.