On a wider class of prior distributions for graphical models

DOI10.1017/jpr.2023.33arXiv2205.04324OpenAlexW4379881929MaRDI QIDQ6198974

Willem van den Boom, Unnamed Author, Maria De Iorio, Unnamed Author

Publication date: 23 February 2024

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Markov chain Monte Carlocycle spaceBayesian statisticsvector spaceGaussian graphical modelnetwork inference

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Probabilistic graphical models (62H22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Copula Gaussian graphical models and their application to modeling functional disability data
• Matrix tree theorems
• Hyper Markov laws in the statistical analysis of decomposable graphical models
• Chordal completions of planar graphs
• Bayesian inference for multiple Gaussian graphical models with application to metabolic association networks
• Exact formulas for the normalizing constants of Wishart distributions for graphical models
• Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions
• Simulation of hyper-inverse Wishart distributions for non-decomposable graphs
• Unbiased approximation of posteriors via coupled particle Markov chain Monte Carlo
• Bayesian graph selection consistency under model misspecification
• Experiments in stochastic computation for high-dimensional graphical models
• Linear Algebra Done Right
• Graphical Models with R
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
• Decomposable graphical Gaussian model determination
• An almost-linear time algorithm for uniform random spanning tree generation
• Bayesian Inference of Multiple Gaussian Graphical Models
• Sampling decomposable graphs using a Markov chain on junction trees
• A Monte Carlo method for computing the marginal likelihood in nondecomposable Gaussian graphical models
• Efficient local updates for undirected graphical models