Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558)

The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. The author obtains improved upper and lower bounds on the mixing times of a number of previously studied Markov chains. Related paper: \textit{D. Aldous} and \textit{P. Diaconis} [Adv. Appl. Math. 8, 69--97 (1987; Zbl 0631.60065)]; \textit{P. Diaconis} and \textit{L. Saloff-Coste} [Ann. Probab. 21, 2131--2156 (1993; Zbl 0790.60011)]; and \textit{M. Luby, D. Randall} and \textit{A. Sinclair} [SIAM J. Comput. 31, 167--192 (2001; Zbl 0992.82013)].