Computable Bounds for Geometric Convergence Rates of Markov Chains

Recent results for geometrically ergodic Markov chains show that there exist constants R<.,.<1 such that sup|f|.V...Pn(x,dy)f(y)...(dy)f(y)...RV(x).n, where . is the invariant probability measure and V is any solution of the drift inequalities .P(x,dy)V(y)..V(x)+blC(x), which are known to guarantee geometric convergence for .<1,b<. and a suitable small set C. In this paper we identify for the first time computable bounds on R and . in terms of .,b and the minorizing constants which guarantee the smallness of C. In the simplest case where C is an atom . with P(.,.).. we can choose any .>., where [1..].1=1(1..)2[1..+b+b2+..(b(1..)+b2)] and ...(32.8.2.3)(b1..)2, and we can then choose R../(...). The bounds for general small sets C are similar but more complex. We apply these to simple queuing models and Markov chain Monte Carlo algorithms, although in the latter the bounds are clearly too large for practical application in the case considered.