Diffusion limit for the random walk Metropolis algorithm out of stationarity
DOI10.1214/18-AIHP929zbMath1467.60056arXiv1405.4896OpenAlexW2963398636MaRDI QIDQ2337836
Andrew M. Stuart, Michela Ottobre, Juan Kuntz
Publication date: 20 November 2019
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.4896
Computational methods in Markov chains (60J22) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (8)
Cites Work
- Unnamed Item
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Optimal scaling for the transient phase of Metropolis Hastings algorithms: the longtime behavior
- Noisy gradient flow from a random walk in Hilbert space
- Asymptotic behaviour of a class of stochastic approximation procedures
- A note on Metropolis-Hastings kernels for general state spaces
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Non-stationary phase of the MALA algorithm
- Optimal scaling for the transient phase of the random walk Metropolis algorithm: the mean-field limit
- A concise course on stochastic partial differential equations
- 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
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
- A function space HMC algorithm with second order Langevin diffusion limit
This page was built for publication: Diffusion limit for the random walk Metropolis algorithm out of stationarity