Improved Mixing Time Bounds for the Thorp Shuffle

DOI10.1017/S0963548312000478zbMath1263.60066arXiv0912.2759OpenAlexW2054037105MaRDI QIDQ4903266

Ben Morris

Publication date: 21 January 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

mixing timeThorp shuffle

Mathematics Subject Classification ID

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

Related Items (6)

Entropy-variance inequalities for discrete log-concave random variables via degree of freedom ⋮ Modified log-Sobolev inequalities for strongly log-concave distributions ⋮ Deterministic encryption with the Thorp shuffle ⋮ Majorization and Rényi entropy inequalities via Sperner theory ⋮ Cutoff for the asymmetric riffle shuffle ⋮ Pseudorandom Functions: Three Decades Later

Cites Work

• Unnamed Item
• Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• How to Construct Pseudorandom Permutations from Pseudorandom Functions

This page was built for publication: Improved Mixing Time Bounds for the Thorp Shuffle