A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
DOI10.1016/S0378-3758(02)00143-XzbMATH Open1045.62054OpenAlexW2014076803MaRDI QIDQ1395885FDOQ1395885
Authors: 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
Recommendations
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- A graphical characterization of lattice conditional independence models
- Gibbs and Markov properties of graphs
- On chain graph models for description of conditional independence structures
- A characterization of Markov equivalence classes for acyclic digraphs
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) Applications of graph theory (05C90) Measures of association (correlation, canonical correlation, etc.) (62H20) Trees (05C05)
Cites Work
- 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?)
- Linear Recursive Equations, Covariance Selection, and Path Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trivially perfect graphs
- Title not available (Why is that?)
- The Comparability Graph of a Tree
- Title not available (Why is that?)
- A graphical characterization of lattice conditional independence models
- A Note on "The Comparability Graph of a Tree"
- Lattice models for conditional independence in a multivariate normal distribution
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- Independence properties of directed markov fields
- Title not available (Why is that?)
- Enumeration of \(P_4\)-free chordal graphs
- Minimal covers of finite sets
- Counting labelled chordal graphs
Cited In (9)
- Rota–Baxter operators on a sum of fields
- Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
- Wishart distributions on homogeneous cones
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- Lattice conditional independence models and Hibi ideals
- Comments on: Sequences of regressions and their independences
- Sequences of regressions and their independences
- Binary distributions of concentric rings
- Probability distributions with summary graph structure
This page was built for publication: A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395885)
