Markov properties for mixed graphs
From MaRDI portal
Publication:2448708
DOI10.3150/12-BEJ502zbMath1303.60064arXiv1109.5909OpenAlexW1967416529WikidataQ57394006 ScholiaQ57394006MaRDI QIDQ2448708
Kayvan Sadeghi, Steffen L. Lauritzen
Publication date: 5 May 2014
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.5909
Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05)
Related Items (20)
Every LWF and AMP Chain Graph Originates from a Set of Causal Models ⋮ Palindromic Bernoulli distributions ⋮ Graphical modeling for gene set analysis: A critical appraisal ⋮ Causal effect identification in acyclic directed mixed graphs and gated models ⋮ Nested Markov properties for acyclic directed mixed graphs ⋮ Learning marginal AMP chain graphs under faithfulness revisited ⋮ Computing maximum likelihood estimates for Gaussian graphical models with Macaulay2 ⋮ Generalized Permutohedra from Probabilistic Graphical Models ⋮ Star graphs induce tetrad correlations: for Gaussian as well as for binary variables ⋮ Markovian acyclic directed mixed graphs for discrete data ⋮ Marginal AMP chain graphs ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians ⋮ Context-specific independencies in stratified chain regression graphical models ⋮ Unifying Markov properties for graphical models ⋮ A review of Gaussian Markov models for conditional independence ⋮ Large-scale local causal inference of gene regulatory relationships ⋮ Faithfulness of Probability Distributions and Graphs ⋮ Time-like Graphical Models ⋮ Comments on: Sequences of regressions and their independences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete chain graph models
- Probability distributions with summary graph structure
- Markov fields and log-linear interaction models for contingency tables
- On association models defined over independence graphs
- A characterization of Markov equivalence classes for acyclic digraphs
- Gibbs and Markov properties of graphs
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Ancestral graph Markov models.
- Marginalizing and conditioning in graphical models
- Triangular systems for symmetric binary variables
- Stable mixed graphs
- Alternative Markov Properties for Chain Graphs
- Binary Models for Marginal Independence
- Markov Properties for Acyclic Directed Mixed Graphs
- Chain Graph Models and their Causal Interpretations
- Identifying independence in bayesian networks
- A Theorem about Random Fields
This page was built for publication: Markov properties for mixed graphs