scientific article

zbMath1252.62058MaRDI QIDQ3637504

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

Publication date: 10 July 2009

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

strong equivalenceessential graphfactorisation equivalencefeasible merging componentslegal merging components

Mathematics Subject Classification ID

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

Related Items (7)

Characteristic imsets for learning Bayesian network structure ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ A reconstruction algorithm for the essential graph ⋮ Faithfulness in chain graphs: the discrete case ⋮ On a hypergraph probabilistic graphical model ⋮ Standard imsets for undirected and chain graphical models ⋮ Chain graph interpretations and their relations revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• Alternative Markov Properties for Chain Graphs
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• 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: