Stable mixed graphs

DOI10.3150/12-BEJ454zbMath1317.05077arXiv1110.4168MaRDI QIDQ2435245

Kayvan Sadeghi

Publication date: 4 February 2014

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.4168

zbMATH Keywords

directed acyclic graphancestral graphindependence modelMC graphsummary graph\(m\)-separation criterionmarginalisation and conditioning

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Marginalization and conditioning for LWF chain graphs ⋮ Markov equivalence of marginalized local independence graphs ⋮ Markovian acyclic directed mixed graphs for discrete data ⋮ Marginal AMP chain graphs ⋮ Markov properties for mixed graphs ⋮ Unifying Markov properties for graphical models ⋮ A review of Gaussian Markov models for conditional independence ⋮ Faithfulness of Probability Distributions and Graphs

Cites Work

• Probability distributions with summary graph structure
• Partial inversion for linear systems and partial closure of independence 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
• Distortion of effects caused by indirect confounding
• Independence properties of directed markov fields
• Joint Response Graphs and Separation Induced by Triangular Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stable mixed graphs