Improved bounds for the mixing time of the random-to-random insertion shuffle
Abstract
We prove an upper bound of 1.5324 n n for the mixing time of the random-to-random insertion shuffle, improving on the best known upper bound of 2 n n. Our proof is based on the analysis of a non-Markovian coupling.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.