Partial mixing of semi-random transposition shuffles

Abstract : We show that for any semi-random transposition shuffle on $n$ cards, the mixing time of any given $k$ cards is at most $n\log k$, provided $k=o((n/\log n)^{1/2})$. In the case of the top-to-random transposition shuffle we show that there is cutoff at this time with a window of size O(n), provided further that $k\to\infty$ as $n\to\infty$ (and no cutoff otherwise). For the random-to-random transposition shuffle we show cutoff at time $(1/2)n\log k$ for the same conditions on $k$. Finally, we analyse the cyclic-to-random transposition shuffle and show partial mixing occurs at time $\le\alpha n\log k$ for some $\alpha$ just larger than 1/2. We prove these results by relating the mixing time of $k$ cards to the mixing of one card. Our results rely heavily on coupling arguments to bound the total variation distance.
Type de document :
Pré-publication, Document de travail
23 pages, 4 figures. 2013
Liste complète des métadonnées
Contributeur : Richard Pymar <>
Soumis le : jeudi 21 février 2013 - 18:08:24
Dernière modification le : mercredi 19 décembre 2018 - 14:08:04

Lien texte intégral


  • HAL Id : hal-00793202, version 1
  • ARXIV : 1302.2601



Richard Pymar. Partial mixing of semi-random transposition shuffles. 23 pages, 4 figures. 2013. 〈hal-00793202〉



Consultations de la notice