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)

Full work available at URL https://doi.org/10.1016/S0888-613X(99)00003-1

zbMATH Keywords

graphical modelslargest chain graphsMarkov equivalence

Mathematics Subject Classification ID

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

Review text

Chain graphs are graphical models of conditional independence structures of random variables. A characterization of largest chain graphs is given and an algorithm is described and used to generate all largest chain graphs with at most five vertices.

Recommendations

• An efficient algorithm for finding the largest chain graph according to a given chain graph
• A recovery algorithm for chain graphs
• scientific article; zbMATH DE number 4174001
• On chain graph models for description of conditional independence structures

Cites work

• 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
• 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?)
• 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

(16)

• 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 recovery algorithm for chain graphs
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Markov equivalence of marginalized local independence graphs
• Chain graph interpretations and their relations revisited
• Formulas for counting acyclic digraph Markov equivalence classes
• Characterizing Markov equivalence classes for AMP chain graph models
• A scoring criterion for learning chain graphs
• A characterization of chain graphs
• On Block Ordering of Variables in Graphical Modelling
• Two operations of merging and splitting components in a chain graph
• Maximal chains of isomorphic subgraphs of the Rado graph
• 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
• An efficient algorithm for finding the largest chain graph according to a given chain graph

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)