Mixing time of the card-cyclic-to-random shuffle
From MaRDI portal
Publication:744375
DOI10.1214/13-AAP964zbMath1321.60143arXiv1207.3406OpenAlexW2047080986MaRDI QIDQ744375
Weiyang Ning, Ben Morris, Yuval Peres
Publication date: 25 September 2014
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3406
Related Items (4)
Generation of the symmetric group Sn2 ⋮ Spectral analysis of random-to-random Markov chains ⋮ Cutoff for random to random card shuffle ⋮ Cutoff for the cyclic adjacent transposition shuffle
Cites Work
- A lower bound for the mixing time of the random-to-random insertions shuffle
- Comparison techniques for random walk on finite groups
- Convergence of some time inhomogeneous Markov chains via spectral techniques
- Generating a random permutation with random transpositions
- Probability Inequalities for Sums of Bounded Random Variables
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mixing time of the card-cyclic-to-random shuffle
