Orthogonality and probability: mixing times

Abstract

We produce the first example of bounding total variation distance to stationarity and estimating mixing times via orthogonal polynomials diagonalization of discrete reversible Markov chains, the Karlin-McGregor approach.

References in corpus (1)

• Renewal theory and computable convergence rates for geometrically ergodic Markov chains