Biased random-to-top shuffling

DOI10.1214/10505160600000097zbMath1126.60009arXivmath/0607124OpenAlexW3100291420MaRDI QIDQ997960

Johan Jonasson

Publication date: 8 August 2007

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

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

zbMATH Keywords

upper boundlower boundmixing timecoupling

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Stochastic processes (60G99)

Related Items (2)

Card shuffling and Diophantine approximation ⋮ Analysis of top to bottom-\(k\) shuffles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trailing the dovetail shuffle to its lair
• Mixing times of lozenge tiling and card shuffling Markov chains
• Mixing time of the Rudvalis shuffle
• Analysis of top to bottom-\(k\) shuffles
• The overhand shuffle mixes in \(\Theta(n^2\log n)\) steps
• Shuffling Cards and Stopping Times
• The Asymptotic Behavior of the Solutions of a Class of Differential-Difference Equations
• Convergence to stationary state for a Markov move-to-front scheme

This page was built for publication: Biased random-to-top shuffling