# Geometric ergodicity of the Random Walk Metropolis with position-dependent proposal covariance

arXiv: https://arxiv.org/abs/1507.05780 · HTML: https://mlsanity.com/paper/1507.05780/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Jul 2015.

## Built on by (most cited first, 5 of 5)

- [AutoStep: Locally adaptive involutive MCMC](https://mlsanity.com/paper/2410.18929/) (2024)
- [Asymptotically exact variational flows via involutive MCMC kernels](https://mlsanity.com/paper/2506.02162/) (2025)
- [A Critical Review of Monte Carlo Algorithms Balancing Performance and Probabilistic Accuracy with AI Augmented Framework](https://mlsanity.com/paper/2512.17968/) (2025)
- [Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling](https://mlsanity.com/paper/2606.23867/) (2026)
- [Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling](https://mlsanity.com/paper/2609.08172/) (2026)

## Abstract (arXiv)

We consider a Metropolis--Hastings method with proposal N(x, hG(x)-1), where x is the current state, and study its ergodicity properties. We show that suitable choices of G(x) can change these compared to the Random Walk Metropolis case N(x, hSigma), either for better or worse. We find that if the proposal variance is allowed to grow unboundedly in the tails of the distribution then geometric ergodicity can be established when the target distribution for the algorithm has tails that are heavier than exponential, but that the growth rate must be carefully controlled to prevent the rejection rate approaching unity. We also illustrate that a judicious choice of G(x) can result in a geometrically ergodic chain when probability concentrates on an ever narrower ridge in the tails, something that is not true for the Random Walk Metropolis.