Open Access
Translator Disclaimer
2017 Improved bounds for the mixing time of the random-to-random shuffle
Chuan Qin, Ben Morris
Electron. Commun. Probab. 22: 1-7 (2017). DOI: 10.1214/17-ECP3955

Abstract

We prove an upper bound of $1.5321 n \log n$ for the mixing time of the random-to-random insertion shuffle, improving on the best known upper bound of $2 n \log n$. Our proof is based on the analysis of a non-Markovian coupling.

Citation

Download Citation

Chuan Qin. Ben Morris. "Improved bounds for the mixing time of the random-to-random shuffle." Electron. Commun. Probab. 22 1 - 7, 2017. https://doi.org/10.1214/17-ECP3955

Information

Received: 29 November 2014; Accepted: 26 November 2015; Published: 2017
First available in Project Euclid: 4 April 2017

zbMATH: 1361.60061
MathSciNet: MR3635695
Digital Object Identifier: 10.1214/17-ECP3955

Subjects:
Primary: 60J10

JOURNAL ARTICLE
7 PAGES


SHARE
Back to Top