To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr13x83k7g| Abstract: | In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Subag, we prove that this walk exhibits cutoff at 3/4 n log n - 1/4 n log log n with window of order n, answering a conjecture of Diaconis. |
| Publication Date: | Sep-2019 |
| Citation: | Bernstein, Megan, Nestoridi, Evita. (2019). CUTOFF FOR RANDOM TO RANDOM CARD SHUFFLE. ANNALS OF PROBABILITY, 47 (3303 - 3320. doi:10.1214/19-AOP1340 |
| DOI: | doi:10.1214/19-AOP1340 |
| ISSN: | 0091-1798 |
| Pages: | 3303 - 3320 |
| Language: | English |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | ANNALS OF PROBABILITY |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.