Diffusion limits of the random walk Metropolis algorithm in high dimensions
DOI10.1214/10-AAP754zbMath1254.60081arXiv1003.4306OpenAlexW2127836946MaRDI QIDQ433896
Natesh S. Pillai, Andrew M. Stuart, Jonathan C. Mattingly
Publication date: 8 July 2012
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.4306
Markov chain Monte Carlostochastic partial differential equationsscaling limitsoptimal convergenceconvergence timedifffusion limitrandom walk Metropolis-Hastings
Computational methods in Markov chains (60J22) Central limit and other weak theorems (60F05) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05) Numerical analysis or methods applied to Markov chains (65C40) Stochastic partial differential equations (aspects of stochastic analysis) (60H15)
Related Items
Cites Work
- Asymptotic behaviour of a class of stochastic approximation procedures
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- From Metropolis to diffusions: Gibbs states and optimal scaling.
- Optimal scaling of MaLa for nonlinear regression.
- Stein's method for concentration inequalities
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Weak convergence of Metropolis algorithms for non-I.I.D. target distributions
- Monte Carlo strategies in scientific computing.
- Analysis of SPDEs arising in path sampling. II: The nonlinear case
- Analysis of SPDEs arising in path sampling. I: The Gaussian case
- Inverse problems: A Bayesian perspective
- Approximation of Bayesian Inverse Problems for PDEs
- MCMC METHODS FOR DIFFUSION BRIDGES
- Pathwise accuracy and ergodicity of metropolized integrators for SDEs
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Monte Carlo sampling methods using Markov chains and their applications
- Stochastic Equations in Infinite Dimensions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item