Abstract
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, Randall and Sinclair to generate random tilings of regions by lozenges. For an
Citation
David Bruce Wilson. "Mixing times of lozenge tiling and card shuffling Markov chains." Ann. Appl. Probab. 14 (1) 274 - 325, February 2004. https://doi.org/10.1214/aoap/1075828054
Information