|Date: Friday, February 16, 2018
Location: 4088 East Hall (4:10 PM to 5:00 PM)
Title: Cutoff for random to random card shuffle (cancelled)
Abstract: Random to random is a card shuffling model that was created to study strong stationary times. Although the mixing time of random to random has been known to be of order nlog(n) since 2002, cutoff had been an open question for many years, and a strong stationary time giving the correct order for the mixing time is still not known. In joint work with Megan Bernstein, we use the eigenvalues of the random to random card shuffling to prove a sharp upper bound for the total variation mixing time. Our upper bound, combined with the lower bound due to Subag, proves that this walk exhibits cutoff at 3/4 n log(n), answering a conjecture of Diaconis.
Speaker: Evita Nestoridi
Institution: Princeton U.