On chain graph models for description of conditional independence structures
From MaRDI portal
Publication:1807127
DOI10.1214/AOS/1024691250zbMATH Open0930.62066OpenAlexW2000451060MaRDI QIDQ1807127FDOQ1807127
Authors: Milan Studený, Remco Bouckaert 
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
Recommendations
Multivariate analysis (62H99) Applications of graph theory (05C90) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Graph theory (including graph drawing) in computer science (68R10)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identifying independence in bayesian networks
- Logical and algorithmic properties of conditional independence and graphical models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Markov properties of nonrecursive causal models
- A graphical characterization of the largest chain graphs
- Independence properties of directed markov fields
- Title not available (Why is that?)
- Logical and algorithmic properties of independence and their application to Bayesian networks
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- A recovery algorithm for chain graphs
- Title not available (Why is that?)
Cited In (37)
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS
- Towards classification of semigraphoids.
- Graphical dynamic linear models: Specification, use and graphical transformations
- Unifying Markov properties for graphical models
- Temporal aggregation in chain graph models
- Graphical and algebraic representatives of conditional independence models
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Characterization of inclusion neighbourhood in terms of the essential graph
- Faithfulness of probability distributions and graphs
- Acyclic directed graphs representing independence models
- Joint Response Graphs and Separation Induced by Triangular Systems
- Title not available (Why is that?)
- Conditional independence structure and its closure: inferential rules and algorithms
- Marginalization and conditioning for LWF chain graphs
- Bayesian network based multiagent system -- application in e-marketplace
- The L-separation criterion for description of cs-independence models
- Context-specific independencies embedded in chain graph models of type I
- Partial inversion for linear systems and partial closure of independence graphs
- Minimal sufficient causation and directed acyclic graphs
- Faithfulness in chain graphs: the discrete case
- Possibility theory: conditional independence
- Conditional independence and chain event graphs
- Separation and completeness properties for AMP chain graph Markov models.
- Matrix representations and independencies in directed acyclic graphs
- A scoring criterion for learning chain graphs
- Multiple testing and error control in Gaussian graphical model selection
- Standard imsets for undirected and chain graphical models
- Every LWF and AMP chain graph originates from a set of causal models
- Acyclic Directed Graphs to Represent Conditional Independence Models
- A note on faithfulness and total positivity
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- Characterizing Markov equivalence classes for AMP chain graph models
- Chain Graph Models and their Causal Interpretations
- Qualitative chain graphs and their application
- Chordal Graphs to Identify Graphical Model Solutions of Maximum of Entropy Under Constraints on Marginals
- A graphical characterization of the largest chain graphs
This page was built for publication: On chain graph models for description of conditional independence structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807127)
