CUTOFF FOR THE CYCLIC ADJACENT TRANSPOSITION SHUFFLE
Author(s): Nam, Danny; Nestoridi, Evita
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1h70809s| Abstract: | We study the cyclic adjacent transposition (CAT) shuffle of n cards, which is a systematic scan version of the random adjacent transposition (AT) card shuffle. In this paper, we prove that the CAT shuffle exhibits cutoff at n(3)/2 pi(2) log n, which concludes that it is twice as fast as the AT shuffle. This is the first verification of cutoff phenomenon for a time-inhomogeneous card shuffle. |
| Publication Date: | Dec-2019 |
| Citation: | Nam, Danny, Nestoridi, Evita. (2019). CUTOFF FOR THE CYCLIC ADJACENT TRANSPOSITION SHUFFLE. ANNALS OF APPLIED PROBABILITY, 29 (3861 - 3892. doi:10.1214/19-AAP1495 |
| DOI: | doi:10.1214/19-AAP1495 |
| ISSN: | 1050-5164 |
| Pages: | 3861 - 3892 |
| Language: | English |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | ANNALS OF APPLIED PROBABILITY |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.