The random walk Metropolis: linking theory and practice through a case study

DOI10.1214/10-STS327zbMath1328.60177arXiv1011.6217WikidataQ61434492 ScholiaQ61434492MaRDI QIDQ903288

Gareth O. Roberts, Chris Sherlock, Paul Fearnhead

Publication date: 5 January 2016

Published in: Statistical Science (Search for Journal in Brave)

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

zbMATH Keywords

adaptive MCMC; MCMC; Metropolis-Hastings; random walk Metropolis; MMPP

Mathematics Subject Classification ID

60J22: Computational methods in Markov chains

Related Items

Inference for reaction networks using the linear noise approximation, Information-geometric Markov chain Monte Carlo methods using diffusions, Markov chain Monte Carlo and irreversibility, Stochastic tail index model for high frequency financial data with Bayesian analysis, Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions, On the efficiency of pseudo-marginal random walk Metropolis algorithms

Cites Work

• Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
• Markov chains and stochastic stability
• Optimal scaling for partially updating MCMC algorithms
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Optimal scaling for various Metropolis-Hastings algorithms.
• Polynomial convergence rates of Markov chains
• Rates of convergence of the Hastings and Metropolis algorithms
• Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
• Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234
• An Exact Gibbs Sampler for the Markov-Modulated Poisson Process
• Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
• Bayesian Analysis of Single-Molecule Experimental Data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item