Margins of discrete Bayesian networks
From MaRDI portal
Publication:1991671
DOI10.1214/17-AOS1631zbMath1408.62044arXiv1501.02103MaRDI QIDQ1991671
Publication date: 30 October 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.02103
Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Markov processes: hypothesis testing (62M02)
Related Items (6)
Nested Markov properties for acyclic directed mixed graphs ⋮ Causal structure learning: a combinatorial perspective ⋮ Latent free equivalent mDAGs ⋮ Smooth, identifiable supermodels of discrete DAG models with latent variables ⋮ Foundations of structural causal models with cycles and latent variables ⋮ Graphs for Margins of Bayesian Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistics, causality and Bell's theorem
- Markovian acyclic directed mixed graphs for discrete data
- Likelihood ratio tests and singularities
- Identifiability of parameters in latent structure models with many observed variables
- Causation, prediction, and search
- Ancestral graph Markov models.
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- Algebraic geometry of Bayesian networks
- Graphs for Margins of Bayesian Networks
- Theory-independent limits on correlations from generalized Bayesian networks
- Modeling and Reasoning with Bayesian Networks
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Markov Properties for Acyclic Directed Mixed Graphs
- A new approach to causal inference in mortality studies with a sustained exposure period—application to control of the healthy worker survivor effect
- Influence Diagrams for Causal Modelling and Inference
- Algorithms in real algebraic geometry
This page was built for publication: Margins of discrete Bayesian networks
