On chain graph models for description of conditional independence structures

DOI10.1214/AOS/1024691250zbMath0930.62066OpenAlexW2000451060MaRDI QIDQ1807127

Remco R. Bouckaert, Milan Studený

Publication date: 9 November 1999

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1024691250

zbMATH Keywords

completenessconditional independencechain graphc-separationMarkovian distribution

Mathematics Subject Classification ID

Multivariate analysis (62H99) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Related Items (27)

DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ Every LWF and AMP Chain Graph Originates from a Set of Causal Models ⋮ Marginalization and conditioning for LWF chain graphs ⋮ Partial inversion for linear systems and partial closure of independence graphs ⋮ Joint Response Graphs and Separation Induced by Triangular Systems ⋮ Bayesian network based multiagent system -- application in e-marketplace ⋮ Acyclic directed graphs representing independence models ⋮ Qualitative chain graphs and their application ⋮ Multiple testing and error control in Gaussian graphical model selection ⋮ Towards classification of semigraphoids. ⋮ A note on faithfulness and total positivity ⋮ Conditional independence structure and its closure: inferential rules and algorithms ⋮ Faithfulness in chain graphs: the discrete case ⋮ Characterization of inclusion neighbourhood in terms of the essential graph ⋮ Chain Graph Models and their Causal Interpretations ⋮ Temporal aggregation in chain graph models ⋮ Possibility theory: conditional independence ⋮ Characterizing Markov equivalence classes for AMP chain graph models ⋮ Standard imsets for undirected and chain graphical models ⋮ Unifying Markov properties for graphical models ⋮ A graphical characterization of the largest chain graphs ⋮ Minimal sufficient causation and directed acyclic graphs ⋮ Acyclic Directed Graphs to Represent Conditional Independence Models ⋮ Faithfulness of Probability Distributions and Graphs ⋮ Separation and completeness properties for AMP chain graph Markov models. ⋮ The L-separation criterion for description of cs-independence models ⋮ Graphical dynamic linear models: Specification, use and graphical transformations

Cites Work

• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Logical and algorithmic properties of conditional independence and graphical models
• Markov properties of nonrecursive causal models
• Logical and algorithmic properties of independence and their application to Bayesian networks
• A characterization of Markov equivalence classes for acyclic digraphs
• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Independence properties of directed markov fields
• Identifying independence in bayesian networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On chain graph models for description of conditional independence structures