Abstract
Essential graphs and largest chain graphs are well-established graphical representations of equivalence classes of directed acyclic graphs and chain graphs respectively, especially useful in the context of model selection. Recently, the notion of a labelled block ordering of vertices \({\mathcal{B}}\) was introduced as a flexible tool for specifying subfamilies of chain graphs. In particular, both the family of directed acyclic graphs and the family of “unconstrained” chain graphs can be specified in this way, for the appropriate choice of \({\mathcal{B}}\) . The family of chain graphs identified by a labelled block ordering of vertices \({\mathcal{B}}\) is partitioned into equivalence classes each represented by means of a \({\mathcal{B}}\) -essential graph. In this paper, we introduce a topological ordering of meta-arrows and use this concept to devise an efficient procedure for the construction of \({\mathcal{B}}\) -essential graphs. In this way we also provide an efficient procedure for the construction of both largest chain graphs and essential graphs. The key feature of the proposed procedure is that every meta-arrow needs to be processed only once.
Similar content being viewed by others
References
Andersson SA, Madigan D, Perlman MD (1997) A characterization of Markov equivalence classes for acyclic digraphs. Annal Stat 25:505–541
Chickering DM (1995) A transformational characterization of equivalent Bayesian network structures. In: Besnard P, Hanks S (eds). Proceedings of the eleventh conference on uncertainty in artificial intelligence. Morgan Kaufmann, San Francisco, pp. 87–98
Chickering DM (2002) Learning equivalence classes of Bayesian-network structure. J Mach Learn Res 2:445–498
Cowell RG, Dawid AP, Lauritzen SL, Spiegelhalter DJ (1999) Probabilistic networks and expert systems. Springer, New York
Frydenberg M (1990) The chain graph Markov property. Scand J Stat 17:333–353
Lauritzen SL (1996) Graphical models. Oxford University Press, Oxford
Roverato A (2005) A unified approach to the characterisation of equivalence classes of DAGs, chain graphs with no flags and chain graphs. Scand J Stat 32:295–312
Roverato A, La Rocca L (2006) On block ordering of variables in graphical modelling. Scand J Stat 33:65–81
Roverato A, Studený M (2006) A graphical representation of equivalence classes of AMP chain graphs. J Mach Learn Res 7:1045–1078
Studený M (1997) A recovery algorithm for chain graphs. Int J Approx Reason 17:265–293
Studený M (2004) Characterization of essential graphs by means of an operation of legal component merging. Int J Uncertainty Fuzziness Knowl Based Syst 12:43–62
Volf M, Studený M (1999) A graphical characterization of the largest chain graphs. Int J Approx Reason 20:209–236
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
La Rocca, L., Roverato, A. Chain graph models: topological sorting of meta-arrows and efficient construction of \({\mathcal{B}}\) -essential graphs. Stat. Meth. & Appl. 17, 73–83 (2008). https://doi.org/10.1007/s10260-007-0050-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10260-007-0050-z