A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
From MaRDI portal
Publication:5467694
DOI10.1111/J.1467-9469.2005.00422.XzbMath1090.62066OpenAlexW2056990151MaRDI QIDQ5467694
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
Multivariate analysis (62H99) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Paths and cycles (05C38)
Related Items (10)
Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures ⋮ Sequences of regressions and their independences ⋮ Unnamed Item ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ A reconstruction algorithm for the essential graph ⋮ Characterization of inclusion neighbourhood in terms of the essential graph ⋮ Characterizing Markov equivalence classes for AMP chain graph models ⋮ Bayesian learning of multiple directed networks from observational data ⋮ Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs ⋮ On Block Ordering of Variables in Graphical Modelling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of Markov equivalence classes for acyclic digraphs
- A graphical characterization of the largest chain graphs
- A recovery algorithm for chain graphs
- Alternative Markov Properties for Chain Graphs
- Probabilistic Networks and Expert Systems
- Introduction to Graphical Modelling
- Chain Graph Models and their Causal Interpretations
- 10.1162/153244302760200696
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
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