A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
From MaRDI portal
Acyclic directed graph Markov modelConditional independenceDecomposable Markov modelFinite distributive latticeGraphical Markov modelLabeled treeLattice conditional independence Markov modelMultivariate distributionPosetTransitive acyclic directed graph Markov modelTree conditional independence Markov modelUndirected graph Markov model
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
Cites work
- A characterization of Markov equivalence classes for acyclic digraphs
- A graphical characterization of lattice conditional independence models
- A Note on "The Comparability Graph of a Tree"
- Counting labelled chordal graphs
- Enumeration of P₄-free chordal graphs
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 3878159 (Why is no real title available?)
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 165071 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Independence properties of directed markov fields
- Lattice models for conditional independence in a multivariate normal distribution
- Linear Recursive Equations, Covariance Selection, and Path Analysis
- Minimal covers of finite sets
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- The Comparability Graph of a Tree
- Trivially perfect graphs
Cited in
(9)- 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
- Sequences of regressions and their independences
- Comments on: Sequences of regressions and their independences
- Binary distributions of concentric rings
- Rota–Baxter operators on a sum of fields
- Lattice conditional independence models and Hibi ideals
- 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)