Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks

DOI10.2140/ASTAT.2023.14.233MaRDI QIDQ6578646zbMATH OpenFDO

Authors Danai Deligeorgaki, Alex Markham, Pratik Misra, Liam Solus

Publication date 25 July 2024

Published in Algebraic Statistics (Search for Journal in Brave)

zbMATH Keywords

Markov chain Monte CarloBayesian networkscausalityminimal coversindependence numberintersection numbertoric idealsmarginal independenceGröbner basesunconditional equivalence

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Probabilistic graphical models (62H22) Causal inference from observational studies (62D20) Algebraic statistics (62R01) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Recommendations

• Algebraic geometry of Gaussian Bayesian networks
• Structural Markov graph laws for Bayesian model uncertainty
• The marginal factorization of Bayesian networks and its application
• Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
• Independency relationships and learning algorithms for singly connected networks

Cites work

• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 5164182 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 835749 (Why is no real title available?)
• scientific article; zbMATH DE number 6438182 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A characterization of Markov equivalence classes for acyclic digraphs
• Active learning of causal networks with intervention experiments and optimal designs
• Algebraic and Geometric Methods in Discrete Mathematics
• Applications of edge coverings by cliques
• Binomial ideals
• Causality. Models, reasoning, and inference
• Directed Gaussian graphical models with toric vanishing ideals
• Equivalence and Synthesis of Causal Models
• Large-sample learning of Bayesian networks is NP-hard
• Low-Order Conditional Independence Graphs for Inferring Genetic Networks
• Monte Carlo sampling methods using Markov chains and their applications
• Two optimal strategies for active learning of causal models from interventional data
• \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs

This page was built for publication: Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks

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