Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 17 min ago
PreprintarXiv licencearXiv

Cutoff for the Adjacent Transposition Shuffle on a Cycle

Abstract

In the adjacent transposition shuffle on a cycle, n distinct cards are placed at the vertices of a cycle, and adjacent cards swap positions according to independent Poisson clocks of rate 1. We prove that this Markov chain exhibits total variation cutoff at time n2log n/(8π2), with a window of order at most n2loglog n.

Related

  1. Cutoff and a Gaussian-shift profile for the Rudvalis shuffle
    Yunjiang Jiang
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  2. Cutoff for the Overhand Shuffle
    Yunjiang Jiang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  3. On adjoint double shuffle relations and adjoint reduction relations
    Takumi Anzawa
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Double shuffle relations via the Hodge defect
    Nikita Markarian
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Regularised double shuffle relations for planar Arborified Zeta Values
    Pierre Catoire, Pierre J. Clavier, Ku-Yu Fan
    HALPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsHALarXiv
BibTeX
@misc{defant2026cutoff,
  title = {{Cutoff for the Adjacent Transposition Shuffle on a Cycle}},
  author = {Colin Defant},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.40076},
  eprint = {2609.40076},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.40076},
}
RIS
TY  - UNPB
TI  - Cutoff for the Adjacent Transposition Shuffle on a Cycle
AU  - Colin Defant
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.40076
UR  - https://arxiv.org/abs/2609.40076
AB  - In the adjacent transposition shuffle on a cycle, n distinct cards are placed at the vertices of a cycle, and adjacent cards swap positions according to independent Poisson clocks of rate 1. We prove that this Markov chain exhibits total variation cutoff at time n^2log n/(8π^2), with a window of order at most n^2loglog n.
ER  -