Title	Cutoff for the Random to Random Shuffle
Creator	Bernstein, Megan
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-05-18T11:39
Description	(joint work with Evita Nestoridi) The random to random shuffle on a deck of cards is given by at each step choosing a random card from the deck, removing it, and replacing it in a random location. We show an upper bound for the mixing time of the walk of $3/4n\log(n) +cn$ steps. Together with matching lower bound of Subag (2013), this shows the walk mixes with cutoff at $3/4n\log(n)$ steps, answering a conjecture of Diaconis. We use the diagonalization of the walk by Dieker and Saliola (2015), which relates the eigenvalues to skew partitions and desarrangement tableaux.
Extent	15 minutes
Subject	Mathematics; Combinatorics; Group theory and generalizations
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Georgia Institute of Technology
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2017-11-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0357946
URI	http://hdl.handle.net/2429/63600
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos