Hahn polynomials and the Burnside process

Abstract

We study a natural Markov chain on $\{0,1,\cdots ,n\}$ with eigenvectors the Hahn polynomials. This explicit diagonalization makes it possible to get sharp rates of convergence to stationarity. The process, the Burnside process, is a special case of the celebrated `Swendsen-Wang' or `data augmentation' algorithm. The description involves the beta-binomial distribution and Mallows model on permutations. It introduces a useful generalization of the Burnside process.

29 pages; added Section 6 on a continuous limit of the Burnside process; improved the range of the parameter in Theorem 5.2; minor edits

References in corpus (1)

• Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions

Cited by in corpus (3)

• Exactly solvable discrete time Birth and Death processes
• Markov Chains Generated by Convolutions of Orthogonality Measures
• Quantum vs Classical Birth and Death Processes; Exactly Solvable Examples