A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
DOI10.1111/J.1467-9469.2005.00422.XzbMATH Open1090.62066OpenAlexW2056990151MaRDI QIDQ5467694FDOQ5467694
Authors: Alberto Roverato 
Publication date: 24 May 2006
Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-9469.2005.00422.x
Recommendations
- Characterizing Markov equivalence classes for AMP chain graph models
- scientific article; zbMATH DE number 5957357
- An efficient algorithm for finding the largest chain graph according to a given chain graph
- A characterization of Markov equivalence classes for acyclic digraphs
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
Multivariate analysis (62H99) Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Paths and cycles (05C38)
Cites Work
- Introduction to Graphical Modelling
- 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?)
- 10.1162/153244302760200696
- Title not available (Why is that?)
- Probabilistic Networks and Expert Systems
- Chain Graph Models and their Causal Interpretations
- Title not available (Why is that?)
- Alternative Markov properties for chain graphs
- A graphical characterization of the largest chain graphs
- A recovery algorithm for chain graphs
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
Cited In (13)
- On Block Ordering of Variables in Graphical Modelling
- Bayesian learning of multiple directed networks from observational data
- AMP chain graphs: minimal separators and structure learning algorithms
- Two operations of merging and splitting components in a chain graph
- Characterization of inclusion neighbourhood in terms of the essential graph
- Marginalization and conditioning for LWF chain graphs
- An efficient algorithm for finding the largest chain graph according to a given chain graph
- A reconstruction algorithm for the essential graph
- Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
- Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
- Sequences of regressions and their independences
- Characterizing Markov equivalence classes for AMP chain graph models
- Alternative Markov properties for chain graphs
Uses Software
This page was built for publication: A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5467694)
