Card shuffling and Diophantine approximation

DOI10.1214/07-AAP484zbMath1142.60046arXiv0707.2994OpenAlexW3101268327MaRDI QIDQ930684

Yuval Peres, Omer Angel, David Bruce Wilson

Publication date: 1 July 2008

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

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

zbMATH Keywords

Diophantine approximationcard shuffling

Mathematics Subject Classification ID

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

Related Items

Analysis of a non-reversible Markov chain speedup by a single edge ⋮ Sensitivity of Mixing Times in Eulerian Digraphs

Cites Work

• Biased random-to-top shuffling
• Comparison techniques for random walk on finite groups
• Mixing time of the Rudvalis shuffle
• Analysis of top to bottom-\(k\) shuffles
• The Asymptotic Behavior of the Solutions of a Class of Differential-Difference Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item