A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
DOI10.1016/S0378-3758(02)00143-XzbMath1045.62054OpenAlexW2014076803MaRDI QIDQ1395885
Robert Castelo, Arno P. J. M. Siebes
Publication date: 1 July 2003
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(02)00143-x
PosetConditional independenceAcyclic directed graph Markov modelDecomposable Markov modelFinite distributive latticeGraphical Markov modelLabeled treeLattice conditional independence Markov modelMultivariate distributionTransitive acyclic directed graph Markov modelTree conditional independence Markov modelUndirected graph Markov model
Multivariate analysis (62H99) Measures of association (correlation, canonical correlation, etc.) (62H20) Trees (05C05) Applications of graph theory (05C90)
Related Items (7)
Cites Work
- Counting labelled chordal graphs
- Trivially perfect graphs
- Lattice models for conditional independence in a multivariate normal distribution
- A characterization of Markov equivalence classes for acyclic digraphs
- A graphical characterization of lattice conditional independence models
- Enumeration of \(P_4\)-free chordal graphs
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- Minimal covers of finite sets
- The Comparability Graph of a Tree
- Linear Recursive Equations, Covariance Selection, and Path Analysis
- Independence properties of directed markov fields
- A Note on "The Comparability Graph of a Tree"
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A characterization of moral transitive acyclic directed graph Markov models as labeled trees.