Optimizing random scan Gibbs samplers
Publication:853941
DOI10.1016/J.JMVA.2006.05.008zbMath1101.62087OpenAlexW2047040233MaRDI QIDQ853941
George Casella, Richard A. Levine
Publication date: 7 December 2006
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmva.2006.05.008
decision theoryMarkov chain Monte Carlominimax riskadaptive sweep strategiesdeterministic scan Gibbs sampler
Computational methods in Markov chains (60J22) Asymptotic distribution theory in statistics (62E20) Minimax procedures in statistical decision theory (62C20) Inference from stochastic processes (62M99) Numerical analysis or methods applied to Markov chains (65C40)
Related Items (9)
Cites Work
- Comparing sweep strategies for stochastic relaxation
- Reparameterisation issues in mixture modelling and their bearing on MCMC algorithms.
- Convergence control methods for Markov chain Monte Carlo algorithms
- Coordinate selection rules for Gibbs sampling
- Markov chains for exploring posterior distributions. (With discussion)
- Mixture models, latent variables and partitioned importance sampling
- Implementing random scan Gibbs samplers
- Marginal Likelihood from the Gibbs Output
- Sampling-Based Approaches to Calculating Marginal Densities
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Estimating Normal Means with a Dirichlet Process Prior
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
- Estimating normal means with a conjugate style dirichlet process prior
- Bayesian Density Estimation and Inference Using Mixtures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimizing random scan Gibbs samplers