Unifying Markov properties for graphical models
From MaRDI portal
Publication:1800801
DOI10.1214/17-AOS1618zbMath1408.62122arXiv1608.05810WikidataQ57394001 ScholiaQ57394001MaRDI QIDQ1800801
Kayvan Sadeghi, Steffen L. Lauritzen
Publication date: 24 October 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05810
chain graphmixed graph\(d\)-separationindependence modelLWF Markov property\(c\)-separation\(m\)-separationAMP Markov propertycompositional graphoidpairwise Markov propertyregression chain Markov property
Related Items
Gaussoids are two-antecedental approximations of Gaussian conditional independence structures, Markov equivalence of marginalized local independence graphs, Selfadhesivity in Gaussian conditional independence structures, Causal structure learning: a combinatorial perspective, On finite exchangeability and conditional independence, 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, Context-specific independencies in stratified chain regression graphical models, A review of Gaussian Markov models for conditional independence, Conditional independence in max-linear Bayesian networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Granger causality and path diagrams for multivariate time series
- Marginalization and conditioning for LWF chain graphs
- Discrete chain graph models
- Chain graph models of multivariate regression type for categorical data
- Probability distributions with summary graph structure
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Markov fields and log-linear interaction models for contingency tables
- Causation, prediction, and search
- On association models defined over independence graphs
- Markov properties of nonrecursive causal models
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- On chain graph models for description of conditional independence structures
- Separation and completeness properties for AMP chain graph Markov models.
- Ancestral graph Markov models.
- Marginalizing and conditioning in graphical models
- Sequences of regressions and their independences
- Triangular systems for symmetric binary variables
- Stable mixed graphs
- Marginal AMP chain graphs
- Markov properties for mixed graphs
- Alternative Markov Properties for Chain Graphs
- Graphical and Recursive Models for Contingency Tables
- Binary Models for Marginal Independence
- Graphical Models for Marked Point Processes Based on Local Independence
- On equivalence of Markov properties over undirected graphs
- Markov Properties for Acyclic Directed Mixed Graphs
- Identifying independence in bayesian networks
