An improved lower bound for the card-cyclic-to-random shuffle

In the card-cyclic-to-random shuffle of n cards, the cards labelled 1, ..., n are removed in turn, cyclically, and each is reinserted at a uniformly random position. Morris, Ning and Peres proved that the mixing time is of order n log n, with a lower bound of c n log n for every c < 1/(2+2a), where -a+ib is a root of e^{-z} = 1-z and a is about 2.089. We raise the lower constant from about 0.162 to 1/(2a), about 0.239. On functions of the relative order of pairs of cards the chain acts as the exterior square of an explicit n by n matrix. Two eigenvectors of that matrix give an exact eigenfunction of the chain, with eigenvalue of modulus 1 - a/n + O(n^{-2}), and a second-moment argument finishes the proof. Whether the shuffle has cutoff remains open.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24275697
Primary Topic
Probability and Statistical Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An improved lower bound for the card-cyclic-to-random shuffle

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Probability and Statistical Research
preprint

An improved lower bound for the card-cyclic-to-random shuffle

Yitzchak Shmalo
preprint en

Abstract

In the card-cyclic-to-random shuffle of n cards, the cards labelled 1, ..., n are removed in turn, cyclically, and each is reinserted at a uniformly random position. Morris, Ning and Peres proved that the mixing time is of order n log n, with a lower bound of c n log n for every c < 1/(2+2a), where -a+ib is a root of e^{-z} = 1-z and a is about 2.089. We raise the lower constant from about 0.162 to 1/(2a), about 0.239. On functions of the relative order of pairs of cards the chain acts as the exterior square of an explicit n by n matrix. Two eigenvectors of that matrix give an exact eigenfunction of the chain, with eigenvalue of modulus 1 - a/n + O(n^{-2}), and a second-moment argument finishes the proof. Whether the shuffle has cutoff remains open.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Probability and Statistical Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon