Two operations of merging and splitting components in a chain graph

MaRDI QIDQ3637504zbMATH OpenFDO

Authors Milan Studený, Alberto Roverato, S. A. Stepanova

Publication date 10 July 2009

Full work available at URL https://eudml.org/doc/37732, http://www.kybernetika.cz/content/2009/2/208

zbMATH Keywords

strong equivalenceessential graphfactorisation equivalencefeasible merging componentslegal merging components

Mathematics Subject Classification ID

Applications of graph theory (05C90) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Graph theory (05C99)

Recommendations

• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• scientific article; zbMATH DE number 4174001
• Marginalization and conditioning for LWF chain graphs
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Alternative Markov properties for chain graphs

Cites work

• scientific article; zbMATH DE number 5957357 (Why is no real title available?)
• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• Alternative Markov properties for chain graphs
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Graphical models for genetic analyses
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

Cited in

(8)

• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• AMP chain graphs: minimal separators and structure learning algorithms
• On a hypergraph probabilistic graphical model
• A reconstruction algorithm for the essential graph
• Faithfulness in chain graphs: the discrete case
• Standard imsets for undirected and chain graphical models
• Characteristic imsets for learning Bayesian network structure
• Chain graph interpretations and their relations revisited

This page was built for publication: Two operations of merging and splitting components in a chain graph

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