A graphical characterization of the largest chain graphs

DOI10.1016/S0888-613X(99)00003-1MaRDI QIDQ1807602zbMATH OpenFDO

Authors Martin Volf, Milan Studený

Publication date 8 May 2000

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

graphical modelsMarkov equivalencelargest chain graphs

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Structural characterization of families of graphs (05C75)

Recommendations

• An efficient algorithm for finding the largest chain graph according to a given chain graph
• A recovery algorithm for chain graphs
• Publication:3198595
• On chain graph models for description of conditional independence structures

Cites work

• scientific article; zbMATH DE number 992990 (Why is no real title available?)
• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 4211299 (Why is no real title available?)
• scientific article; zbMATH DE number 3635280 (Why is no real title available?)
• scientific article; zbMATH DE number 4126504 (Why is no real title available?)
• scientific article; zbMATH DE number 1222287 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 4867 (Why is no real title available?)
• A recovery algorithm for chain graphs
• Alternative Markov properties for chain graphs
• BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• On chain graph models for description of conditional independence structures
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

Cited in

(15)

• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• On Block Ordering of Variables in Graphical Modelling
• Maximal chains of isomorphic subgraphs of the Rado graph
• Two operations of merging and splitting components in a chain graph
• The size distribution for Markov equivalence classes of acyclic digraph models.
• A characterization of chain graphs
• An efficient algorithm for finding the largest chain graph according to a given chain graph
• Formulas for counting acyclic digraph Markov equivalence classes
• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
• On chain graph models for description of conditional independence structures
• A scoring criterion for learning chain graphs
• Markov equivalence of marginalized local independence graphs
• Characterizing Markov equivalence classes for AMP chain graph models
• Chain graph interpretations and their relations revisited
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs

This page was built for publication: A graphical characterization of the largest chain graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807602)