Abstract
A deck of n cards is shuffled by repeatedly moving the top card to one of the bottom kn positions uniformly at random. We give upper and lower bounds on the total variation mixing time for this shuffle as kn ranges from a constant to n. We also consider a symmetric variant of this shuffle in which at each step either the top card is randomly inserted into the bottom kn positions or a random card from the bottom kn positions is moved to the top. For this reversible shuffle we derive bounds on the L2 mixing time. Finally, we transfer mixing time estimates for the above shuffles to the lazy top to bottom-k walks that move with probability 1/2 at each step.
Citation
Sharad Goel. "Analysis of top to bottom-k shuffles." Ann. Appl. Probab. 16 (1) 30 - 55, February 2006. https://doi.org/10.1214/10505160500000062
Information
