Markov properties for mixed graphs
From MaRDI portal
Abstract: In this paper, we unify the Markov theory of a variety of different types of graphs used in graphical Markov models by introducing the class of loopless mixed graphs, and show that all independence models induced by -separation on such graphs are compositional graphoids. We focus in particular on the subclass of ribbonless graphs which as special cases include undirected graphs, bidirected graphs, and directed acyclic graphs, as well as ancestral graphs and summary graphs. We define maximality of such graphs as well as a pairwise and a global Markov property. We prove that the global and pairwise Markov properties of a maximal ribbonless graph are equivalent for any independence model that is a compositional graphoid.
Recommendations
Cites work
- 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 4094468 (Why is no real title available?)
- scientific article; zbMATH DE number 15992 (Why is no real title available?)
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- scientific article; zbMATH DE number 1222287 (Why is no real title available?)
- scientific article; zbMATH DE number 922429 (Why is no real title available?)
- A Theorem about Random Fields
- A characterization of Markov equivalence classes for acyclic digraphs
- Alternative Markov properties for chain graphs
- Ancestral graph Markov models.
- Binary Models for Marginal Independence
- Chain Graph Models and their Causal Interpretations
- Discrete chain graph models
- Gibbs and Markov properties of graphs
- Identifying independence in bayesian networks
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Marginalizing and conditioning in graphical models
- Markov Properties for Acyclic Directed Mixed Graphs
- Markov fields and log-linear interaction models for contingency tables
- Markov properties for linear causal models with correlated errors
- On association models defined over independence graphs
- Probability distributions with summary graph structure
- Stable mixed graphs
- Triangular systems for symmetric binary variables
Cited in
(34)- Nested Markov properties for acyclic directed mixed graphs
- Time-like Graphical Models
- scientific article; zbMATH DE number 6450685 (Why is no real title available?)
- Towards standard imsets for maximal ancestral graphs
- Unifying Markov properties for graphical models
- Generalized Permutohedra from Probabilistic Graphical Models
- Faithfulness of probability distributions and graphs
- scientific article; zbMATH DE number 7085059 (Why is no real title available?)
- Languages for probabilistic modeling over structured and relational domains
- Markovian acyclic directed mixed graphs for discrete data
- Conditional independence and basic Markov properties
- Palindromic Bernoulli distributions
- IPA for continuous stochastic marked graphs
- Logic of minimal separation in causal networks
- Learning marginal AMP chain graphs under faithfulness revisited
- Causal effect identification in acyclic directed mixed graphs and gated models
- Comments on: Sequences of regressions and their independences
- Star graphs induce tetrad correlations: for Gaussian as well as for binary variables
- Markov equivalence of marginalized local independence graphs
- Computing maximum likelihood estimates for Gaussian graphical models with Macaulay2
- Self-adhesivity in lattices of abstract conditional independence models
- Every LWF and AMP chain graph originates from a set of causal models
- Graphical modeling for gene set analysis: a critical appraisal
- A review of Gaussian Markov models for conditional independence
- Large-scale local causal inference of gene regulatory relationships
- Marginal AMP chain graphs
- scientific article; zbMATH DE number 4126504 (Why is no real title available?)
- Markov Properties for Acyclic Directed Mixed Graphs
- Probability distributions with summary graph structure
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models
- Graphical Markov models for infinitely many variables
- Context-specific independencies in stratified chain regression graphical models
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
This page was built for publication: Markov properties for mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448708)
