Improved bounds for the mixing time of the random-to-random insertion shuffle
Probability
2014-12-02 v1
Abstract
We prove an upper bound of for the mixing time of the random-to-random insertion shuffle, improving on the best known upper bound of . Our proof is based on the analysis of a non-Markovian coupling.
Keywords
Cite
@article{arxiv.1412.0070,
title = {Improved bounds for the mixing time of the random-to-random insertion shuffle},
author = {Ben Morris and Chuan Qin},
journal= {arXiv preprint arXiv:1412.0070},
year = {2014}
}
Comments
7 pages, 1 figure