Abstract
We develop techniques for bounding the rate of convergence of a symmetric random walk on a finite group to the uniform distribution. The techniques gives bounds on the second largest (and other) eigenvalues in terms of the eigenvalues of a comparison chain with known eigenvalues. The techniques yield sharp rates for a host of previously intractable problems on the symmetric group.
Citation
Persi Diaconis. Laurent Saloff-Coste. "Comparison Techniques for Random Walk on Finite Groups." Ann. Probab. 21 (4) 2131 - 2156, October, 1993. https://doi.org/10.1214/aop/1176989013
Information