Unifying Markov properties for graphical models

DOI10.1214/17-AOS1618zbMATH Open1408.62122arXiv1608.05810WikidataQ57394001 ScholiaQ57394001MaRDI QIDQ1800801FDOQ1800801

Authors: Kayvan Sadeghi, Steffen Lauritzen 

Publication date: 24 October 2018

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class of graphs with four types of edges --- lines, arrows, arcs, and dotted lines --- and a single separation criterion. We show that independence structures defined by this class specialize to each of the previously defined cases, when suitable subclasses of graphs are considered. In addition, we define a pairwise Markov property for the subclass of chain mixed graphs which includes chain graphs with the LWF interpretation, as well as summary graphs (and consequently ancestral graphs). We prove the equivalence of this pairwise Markov property to the global Markov property for compositional graphoid independence models.

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

Recommendations

• Markov properties for mixed graphs
• Ancestral graph Markov models.
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Publication:3198595
• On equivalence of Markov properties over undirected graphs

zbMATH Keywords

mixed graphchain graph\(d\)-separationindependence modelLWF Markov property\(c\)-separation\(m\)-separationAMP Markov propertycompositional graphoidpairwise Markov propertyregression chain Markov property

Mathematics Subject Classification ID

Multivariate analysis (62H99) Applications of graph theory (05C90)

Cites Work

• Causation, prediction, and search
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Title not available (Why is that?)
• Ancestral graph Markov models.
• Title not available (Why is that?)
• 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?)
• Graphical Models for Marked Point Processes Based on Local Independence
• Markov Properties for Acyclic Directed Mixed Graphs
• Marginalizing and conditioning in graphical models
• Granger causality and path diagrams for multivariate time series
• Title not available (Why is that?)
• On chain graph models for description of conditional independence structures
• Markov fields and log-linear interaction models for contingency tables
• Sequences of regressions and their independences
• Stable mixed graphs
• Marginal AMP chain graphs
• Alternative Markov properties for chain graphs
• Marginalization and conditioning for LWF chain graphs
• Title not available (Why is that?)
• Discrete chain graph models
• Chain graph models of multivariate regression type for categorical data
• Triangular systems for symmetric binary variables
• Markov properties for mixed graphs
• Binary Models for Marginal Independence
• Separation and completeness properties for AMP chain graph Markov models.
• Markov properties of nonrecursive causal models
• On association models defined over independence graphs
• Graphical and Recursive Models for Contingency Tables
• Title not available (Why is that?)
• On equivalence of Markov properties over undirected graphs

Cited In (14)

• Total positivity in multivariate extremes
• An ancestral process with selection in an ecological community
• On patterns of conditional independences and covariance signs among binary variables
• Title not available (Why is that?)
• Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
• Selfadhesivity in Gaussian conditional independence structures
• Markov equivalence of marginalized local independence graphs
• Causal structure learning: a combinatorial perspective
• On equivalence of Markov properties over undirected graphs
• A review of Gaussian Markov models for conditional independence
• On finite exchangeability and conditional independence
• Conditional independence in max-linear Bayesian networks
• Markov properties for mixed graphs
• Context-specific independencies in stratified chain regression graphical models

Uses Software

• TETRAD

This page was built for publication: Unifying Markov properties for graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800801)