Probabilistic and combinatorial aspects of the card‐cyclic to random insertion shuffle

DOI10.1002/rsa.20505zbMath1309.05021arXiv1105.3618OpenAlexW2009018656MaRDI QIDQ4982620

Ross G. Pinsky

Publication date: 9 April 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random permutationtotal variation normrandom shuffle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (3)

Spectral analysis of random-to-random Markov chains ⋮ Cutoff for random to random card shuffle ⋮ Cutoff for the cyclic adjacent transposition shuffle

Cites Work

• Unnamed Item
• A lower bound for the mixing time of the random-to-random insertions shuffle
• The bias of three pseudo-random shuffles
• Card shuffling and a transformation on \(S_ n\)
• The identity is the most likely exchange shuffle for large \(n\)
• Refined estimates for some basic random walks on the symmetric and alternating groups
• The dead core for reaction-diffusion equations with convection and its connection with the first exit time of the related Markov diffusion process

This page was built for publication: Probabilistic and combinatorial aspects of the card‐cyclic to random insertion shuffle