Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
From MaRDI portal
Publication:2323943
DOI10.1214/19-EJS1585zbMath1431.62339arXiv1805.12571OpenAlexW2970068706MaRDI QIDQ2323943
Felix L. Rios, Jimmy Olsson, Tatjana Pavlenko
Publication date: 13 September 2019
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.12571
Monte Carlo methods (65C05) Stochastic approximation (62L20) Graphical methods in statistics (62A09)
Related Items (2)
Graphical posterior predictive classification: Bayesian model averaging with particle Gibbs ⋮ Sequential sampling of junction trees for decomposable graphs
Uses Software
Cites Work
- Unnamed Item
- Comparison of asymptotic variances of inhomogeneous Markov chains with application to Markov chain Monte Carlo methods
- Two methods for the generation of chordal graphs
- A conjugate prior for discrete hierarchical log-linear models
- Gaussian Markov distributions over finite graphs
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Sequential sampling of junction trees for decomposable graphs
- Experiments in stochastic computation for high-dimensional graphical models
- Inference in hidden Markov models.
- On particle Gibbs sampling
- Bayesian clustering in decomposable graphs
- Sequential Monte Carlo Samplers
- A fast procedure for model search in multidimensional contingency tables
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Particle Markov Chain Monte Carlo Methods
- Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
- Decomposable graphical Gaussian model determination
- A structural Markov property for decomposable graph laws that allows control of clique intersections
- Sampling decomposable graphs using a Markov chain on junction trees
- Efficient local updates for undirected graphical models
This page was built for publication: Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
