D. Aldous and P. Diaconis, Shuffling cards and stopping
times, Amer. Math. Monthly 93 (1986), 333-348.
D. Aldous and P. Diaconis, Strong uniform times and finite random
walks, Adv. Appl. Math. 8 (1987), 69-97.
G.-Y. Chen and L. Saloff-Coste, The cutoff phenomenon for ergodic
Markov processes, Electron. J. Probab. 13 (2008), 26-78.
P. Diaconis, The cutoff phenomenon in finite Markov chains,
Proc. Nat. Acad. Sci. USA 93 (1996), 1659-1664.
P. Diaconis, Group Representations in Probability and
Statistics, Inst. Math. Statist., Hayward, CA, 1988.
P. Diaconis and L. Saloff-Coste, Comparison techniques for random
walks on finite groups, Ann. Probab. 21 (1993), 2131-2156.
P. Diaconis and L. Saloff-Coste, Moderate growth and random walk
on finite groups, Geom. Funct. Anal. 4 (1994), 1-36.
J. Hermon and S. Olesker-Taylor, Cutoff for almost all random
walks on abelian groups, arXiv:2102.02809v1 (2021).
J. Hermon and S. Olesker-Taylor, Geometry of random Cayley graphs
of abelian groups, arXiv:2102.02801 (2021).
J. Hermon and S. Olesker-Taylor, Cutoff for almost all random
walks on upper triangular matrices, arXiv:1911.02974v2 (2019).
R. Hough, Mixing and cut-off in cycle walks, Electron. J.
Probab. 22 (2017), art. 90, 49 pp.
E. Lubetzky and A. Sly, Cutoff phenomena for random walks on
random regular graphs, Duke Math. J. 153 (2010), 475-510.
D. Micciancio and O. Regev, Worst-case to average-case reductions
based on Gaussian measures, SIAM J. Comput. 37 (2007), 267-302.
J. Salez, Cutoff for non-negatively curved Markov chains,
arXiv:2102.02809v1 (2021).
L. Saloff-Coste, Random walks on finite groups, in:
Probability on Discrete Structures, Encyclopaedia Math. Sci. 110,
Springer, Berlin, 2004, 263-346. |