CUTOFF FOR THE CYCLIC ADJACENT TRANSPOSITION SHUFFLE

Author(s): Nam, Danny; Nestoridi, Evita

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1h70809s

Full metadata record

DC Field	Value	Language
dc.contributor.author	Nam, Danny	-
dc.contributor.author	Nestoridi, Evita	-
dc.date.accessioned	2023-12-27T20:48:03Z	-
dc.date.available	2023-12-27T20:48:03Z	-
dc.date.issued	2019-12	en_US
dc.identifier.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	en_US
dc.identifier.issn	1050-5164	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1h70809s	-
dc.description.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.	en_US
dc.format.extent	3861 - 3892	en_US
dc.language	English	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	ANNALS OF APPLIED PROBABILITY	en_US
dc.rights	Author's manuscript	en_US
dc.title	CUTOFF FOR THE CYCLIC ADJACENT TRANSPOSITION SHUFFLE	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1214/19-AAP1495	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1805.10508.pdf		308.97 kB	Adobe PDF	View/Download