On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds

DOI10.1214/AOAP/1177005064zbMath0802.60061OpenAlexW1969238664MaRDI QIDQ1333379

Salvatore Ingrassia

Publication date: 12 December 1994

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1177005064

zbMATH Keywords

transition probability matrixboundsspectral gapGibbs samplerMetropolis algorithmrandom updating dynamicsrate of convergence at low temperatures

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (16)

Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). ⋮ Outperforming the Gibbs sampler empirical estimator for nearest-neighbor random fields ⋮ Improved bounds for the large-time behaviour of simulated annealing ⋮ A gentle stochastic thermostat for molecular dynamics ⋮ Markov chain convergence: From finite to infinite ⋮ Coupling, spectral gap and related topics. II ⋮ Constructing optimal transition matrix for Markov chain Monte Carlo ⋮ On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound ⋮ Honest exploration of intractable probability distributions via Markov chain Monte Carlo. ⋮ Markov-chain monte carlo: Some practical implications of theoretical results ⋮ The convergence rate of the Gibbs sampler for generalized 1-D Ising model ⋮ Sensitivity and convergence of uniformly ergodic Markov chains ⋮ What do we know about the Metropolis algorithm? ⋮ The smallest eigenvalue for reversible Markov chains ⋮ Information bounds for Gibbs samplers ⋮ Reversible algorithm of simulating multivariate densities with multi-hump

This page was built for publication: On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds