Mixing Times of Lozenge Tiling and Card Shuffling Markov Chains

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 an...

Ausführliche Beschreibung