Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs

DOI10.1007/S10260-007-0050-ZzbMath1367.62206OpenAlexW2030741286MaRDI QIDQ1019493

Alberto Roverato, Luca La Rocca

Publication date: 2 June 2009

Published in: Statistical Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10260-007-0050-z

zbMATH Keywords

Markov propertyconditional independencepartial orderinggraphical modelwell-orderingMarkov equivalencelabelled block ordering

Mathematics Subject Classification ID

Multivariate analysis (62H99) Characterization and structure theory for multivariate probability distributions; copulas (62H05)

Cites Work

• A characterization of Markov equivalence classes for acyclic digraphs
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• On Block Ordering of Variables in Graphical Modelling
• 10.1162/153244302760200696
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs