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

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

Chris Sherlock, Paul Fearnhead, Gareth O. Roberts

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 MCMCMCMCMetropolis-Hastingsrandom walk MetropolisMMPP

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Related Items

Trajectory inference and parameter estimation in stochastic models with temporally aggregated data, Cauchy Markov random field priors for Bayesian inversion, Information-geometric Markov chain Monte Carlo methods using diffusions, An adaptive multiple-try Metropolis algorithm, Stochastic tail index model for high frequency financial data with Bayesian analysis, Markov chain Monte Carlo and irreversibility, Efficient real-time monitoring of an emerging influenza pandemic: how feasible?, Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions, Accelerating adaptation in the adaptive Metropolis–Hastings random walk algorithm, On the estimation of partially observed continuous-time Markov chains, Flexible Bayesian quantile regression for nonlinear mixed effects models based on the generalized asymmetric Laplace distribution, Optimal scaling of random-walk Metropolis algorithms on general target distributions, Global Sensitivity Analysis for Statistical Model Parameters, Markov chain Monte Carlo algorithms with sequential proposals, Accelerating MCMC via Kriging-based adaptive independent proposals and delayed rejection, Inference for reaction networks using the linear noise approximation, Extending composite loss models using a general framework of advanced computational tools, Efficiency of delayed-acceptance random walk metropolis algorithms, Statistical and deterministic inverse methods in the geosciences: introduction, review, and application to the nonlinear diffusion equation, 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