Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
The authors obtain conditions for geometric and polynomial convergence rates of random-walk-type Markov chains to stationarity in terms of existence of exponential resp.~polynomial moments of the invariant distribution and the transition kernel. An application to the Metropolis algorithm is given.
scientific article; zbMATH DE number 2072453