A graphical characterization of the largest chain graphs

DOI10.1016/S0888-613X(99)00003-1zbMATH Open0935.62063MaRDI QIDQ1807602FDOQ1807602

Authors: Martin Volf, Milan Studený 

Publication date: 8 May 2000

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

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

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)

Cites Work

• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• Title not available (Why is that?)
• On chain graph models for description of conditional independence structures
• Title not available (Why is that?)
• Alternative Markov properties for chain graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• A recovery algorithm for chain graphs

Cited In (15)

• 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
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

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)