Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
多维 Hastings 与 Metropolis 算法的几何收敛和中心极限定理
We develop results on geometric ergodicity of Markov chains and apply these and other recent results in Markov chain theory to multidimensional Hastings and Metropolis algorithms. For those based on random walk candidate distributions, we find sufficient conditions for moments and moment generating functions to converge at a geometric rate to a prescribed distribution π. By phrasing the conditions in terms of the curvature of the densities we show that the results apply to…