On the geometric ergodicity of hybrid samplers
- 1 March 2003
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 40 (1) , 123-146
- https://doi.org/10.1239/jap/1044476831
Abstract
In this paper, we consider the random-scan symmetric random walk Metropolis algorithm (RSM) onℝd. This algorithm performs a Metropolis step on just one coordinate at a time (as opposed to the full-dimensional symmetric random walk Metropolis algorithm, which proposes a transition on all coordinates at once). We present various sufficient conditions implyingV-uniform ergodicity of the RSM when the target density decreases either subexponentially or exponentially in the tails.Keywords
This publication has 18 references indexed in Scilit:
- Geometric ergodicity of Metropolis algorithmsStochastic Processes and their Applications, 2000
- Bounds on regeneration times and convergence rates for Markov chainsStochastic Processes and their Applications, 1999
- On convergence of the EM algorithmand the Gibbs samplerStatistics and Computing, 1999
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithmsBiometrika, 1996
- Rates of convergence of the Hastings and Metropolis algorithmsThe Annals of Statistics, 1996
- Minorization Conditions and Convergence Rates for Markov Chain Monte CarloJournal of the American Statistical Association, 1995
- Markov Chains for Exploring Posterior DistributionsThe Annals of Statistics, 1994
- Discussion: Markov Chains for Exploring Posterior DistributionsThe Annals of Statistics, 1994
- Computable Bounds for Geometric Convergence Rates of Markov ChainsThe Annals of Applied Probability, 1994
- Markov Chains and Stochastic StabilityPublished by Springer Nature ,1993