Graphs for margins of Bayesian networks
From MaRDI portal
Publication:2821469
DOI10.1111/SJOS.12194zbMATH Open1468.62300arXiv1408.1809OpenAlexW1491379284MaRDI QIDQ2821469FDOQ2821469
Authors: Robin J. Evans 
Publication date: 21 September 2016
Published in: Scandinavian Journal of Statistics (Search for Journal in Brave)
Abstract: Directed acyclic graph (DAG) models, also called Bayesian networks, impose conditional independence constraints on a multivariate probability distribution, and are widely used in probabilistic reasoning, machine learning and causal inference. If latent variables are included in such a model, then the set of possible marginal distributions over the remaining (observed) variables is generally complex, and not represented by any DAG. Larger classes of mixed graphical models, which use multiple edge types, have been introduced to overcome this; however, these classes do not represent all the models which can arise as margins of DAGs. In this paper we show that this is because ordinary mixed graphs are fundamentally insufficiently rich to capture the variety of marginal models. We introduce a new class of hyper-graphs, called mDAGs, and a latent projection operation to obtain an mDAG from the margin of a DAG. We show that each distinct marginal of a DAG model is represented by at least one mDAG, and provide graphical results towards characterizing when two such marginal models are the same. Finally we show that mDAGs correctly capture the marginal structure of causally-interpreted DAGs under interventions on the observed variables.
Full work available at URL: https://arxiv.org/abs/1408.1809
Recommendations
Bayesian inference (62F15) Applications of graph theory (05C90) Probabilistic graphical models (62H22)
Cites Work
- Likelihood ratio tests and singularities
- A new approach to causal inference in mortality studies with a sustained exposure period—application to control of the healthy worker survivor effect
- Causality. Models, reasoning, and inference
- Half-trek criterion for generic identifiability of linear structural equation models
- Ancestral graph Markov models.
- Probability distributions with summary graph structure
- Modeling and Reasoning with Bayesian Networks
- Mendelian randomization as an instrumental variable approach to causal inference
- Statistics, causality and Bell's theorem
- Markov Properties for Acyclic Directed Mixed Graphs
- Marginalizing and conditioning in graphical models
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Tensors of nonnegative rank two
- Factor graphs and the sum-product algorithm
- Markovian acyclic directed mixed graphs for discrete data
- Independence properties of directed markov fields
- Margins of discrete Bayesian networks
- Comments on: Sequences of regressions and their independencies
- On the causal interpretation of acyclic mixed graphs under multivariate normality
Cited In (20)
- Discovering agents
- Marginals of DAG-Isomorphic Independence Models
- Title not available (Why is that?)
- Bayesian networks: the minimal triangulations of a graph
- Probability based independence sampler for Bayesian quantitative learning in graphical log-linear marginal models
- Analysing causal structures with entropy
- Margins of discrete Bayesian networks
- Marginalizing and conditioning in graphical models
- Thinning a Triangulation of a Bayesian Network or Undirected Graph to Create a Minimal Triangulation
- A convergent inflation hierarchy for quantum causal structures
- Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
- Latent free equivalent mDAGs
- An Automated Approach to Causal Inference in Discrete Settings
- Marginal Markov subgraph of Bayesian network and its applications
- Foundations of structural causal models with cycles and latent variables
- Markov equivalence of marginalized local independence graphs
- Causal structure learning: a combinatorial perspective
- The hidden life of latent variables: Bayesian learning with mixed graph models
- The marginal factorization of Bayesian networks and its application
- Nested Markov properties for acyclic directed mixed graphs
Uses Software
This page was built for publication: Graphs for margins of Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821469)
