On the Rate of Convergence of the Metropolis Algorithm and Gibbs Sampler by Geometric Bounds

In this paper we obtain bounds on the spectral gap of the transition probability matrix of Markov chains associated with the Metropolis algorithm and with the Gibbs sampler. In both cases we prove that, for small values of T, the spectral gap is equal to 1..2, where .2 is the second largest eigenvalue of P. In the case of the Metropolis algorithm we give also two examples in which the spectral gap is equal to 1..min, where .min is the smallest eigenvalue of P. Furthermore we prove that random updating dynamics on sites based on the Metropolis algorithm and on the Gibbs sampler have the same rate of convergence at low temperatures. The obtained bounds are discussed and compared with those obtained with a different approach.