Markov properties for mixed graphs
From MaRDI portal
Publication:2448708
DOI10.3150/12-BEJ502zbMATH Open1303.60064arXiv1109.5909OpenAlexW1967416529WikidataQ57394006 ScholiaQ57394006MaRDI QIDQ2448708FDOQ2448708
Authors: Kayvan Sadeghi, Steffen Lauritzen 
Publication date: 5 May 2014
Published in: Bernoulli (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1109.5909
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05)
Cites Work
- Title not available (Why is that?)
- A characterization of Markov equivalence classes for acyclic digraphs
- Ancestral graph Markov models.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identifying independence in bayesian networks
- Probability distributions with summary graph structure
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Title not available (Why is that?)
- Markov Properties for Acyclic Directed Mixed Graphs
- Chain Graph Models and their Causal Interpretations
- Marginalizing and conditioning in graphical models
- A Theorem about Random Fields
- Markov fields and log-linear interaction models for contingency tables
- Stable mixed graphs
- Alternative Markov properties for chain graphs
- Title not available (Why is that?)
- Discrete chain graph models
- Triangular systems for symmetric binary variables
- Binary Models for Marginal Independence
- Title not available (Why is that?)
- Title not available (Why is that?)
- On association models defined over independence graphs
- Markov properties for linear causal models with correlated errors
- Title not available (Why is that?)
- Gibbs and Markov properties of graphs
Cited In (34)
- Time-like Graphical Models
- Title not available (Why is that?)
- Towards standard imsets for maximal ancestral graphs
- Generalized Permutohedra from Probabilistic Graphical Models
- Unifying Markov properties for graphical models
- Faithfulness of probability distributions and graphs
- Title not available (Why is that?)
- Languages for probabilistic modeling over structured and relational domains
- Conditional independence and basic Markov properties
- Markovian acyclic directed mixed graphs for discrete data
- Palindromic Bernoulli distributions
- IPA for continuous stochastic marked graphs
- Logic of minimal separation in causal networks
- Learning marginal AMP chain graphs under faithfulness revisited
- Comments on: Sequences of regressions and their independences
- Star graphs induce tetrad correlations: for Gaussian as well as for binary variables
- Causal effect identification in acyclic directed mixed graphs and gated models
- 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
- Title not available (Why is that?)
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Markov Properties for Acyclic Directed Mixed Graphs
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models
- Probability distributions with summary graph structure
- 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
- Nested Markov properties for acyclic directed mixed graphs
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)
