The overhand shuffle mixes in \(\Theta(n^2\log n)\) steps

DOI10.1214/105051605000000692zbMath1095.60013arXivmath/0501401OpenAlexW3125833793MaRDI QIDQ2494578

Johan Jonasson

Publication date: 29 June 2006

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0501401

zbMATH Keywords

mixing timecouplinglower bound, Rudvalis shuffle

Mathematics Subject Classification ID

Stochastic processes (60G99) Markov processes (60J99)

Related Items (3)

Online card games ⋮ Shuffling cards by spatial motion ⋮ Biased random-to-top shuffling

Cites Work

• Randomization time for the overhand shuffle
• Trailing the dovetail shuffle to its lair
• Mixing times of lozenge tiling and card shuffling Markov chains
• Mixing time of the Rudvalis shuffle
• The Asymptotic Behavior of the Solutions of a Class of Differential-Difference Equations
• Unnamed Item

This page was built for publication: The overhand shuffle mixes in \(\Theta(n^2\log n)\) steps