Two operations of merging and splitting components in a chain graph

zbMATH Open1252.62058MaRDI QIDQ3637504FDOQ3637504

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

Publication date: 10 July 2009

Full work available at URL: https://eudml.org/doc/37732

Recommendations

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

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)

Cites Work

• Graphical models for associations between variables, some of which are qualitative and some quantitative
• A characterization of Markov equivalence classes for acyclic digraphs
• Graphical models for genetic analyses
• Title not available (Why is that?)
• Title not available (Why is that?)
• Alternative Markov properties for chain graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A graphical characterization of the largest chain graphs
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• A recovery algorithm for chain graphs
• 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

Cited In (8)

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

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)