Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 58 min ago
PreprintCC BY 4.0arXiv

Adhesive riffle shuffles: one-parameter models and mixing bounds

Abstract

We compare four simple shuffles with one adhesion parameter p: a card-weighted sticky riffle, a block-weighted riffle, a midpoint-interpolation shuffle, and a correlated-label inverse riffle. Independent surviving contacts create contiguous blocks; no force or energy constants are fitted. We give polynomial upper bounds with explicit dependence on p, common adjacency-survival lower bounds, and a sharper information lower bound for interpolation. For fixed deck size n≥4, the mixing time diverges as Θ((1−p)−1) for the three cut-first models, but as Θ((1−p)−2) for the correlated-label model. The latter distinction comes from whether one or two additional contact breaks are needed to escape cyclic rotations. For even n, unglued interpolation retains the lower bound Ω(√nlog n) and upper bound O(n5/2log n). We distinguish proved bounds from conjectured scales, recover classical riffle cutoff under sufficiently small perturbations, and explain precisely where established results on clumpy shuffles apply. The fixed-parameter asymptotic orders of the new cut-first families and their possible cutoff remain unresolved.

Related

  1. Optimal no-feedback card guessing after a fixed number of riffle shuffles
    Tipaluck Krityakierne, Thotsaporn Aek Thanatipanonda
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  2. Second-order perturbation bounds for Gibbs samplers under strong spatial mixing
    Na Lin, Aaron Smith, Yiqiang Q. Zhao
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
  3. Exploiting Exact Conditionals Improves Conditioning: Provably Fast Mixing Time Bounds By Sampling from the Marginal
    Abhijit Chowdhary, Federica Milinanni, Julianne Chung +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Sharp Bounds for Schippers–Schwarzian Derivatives via the Schur-Parameter Method
    Hong Wang, Xiaoyuan Wang
    AxiomsPeer-reviewedCC BY 4.0Geometry & topologyCrossref
  5. Rényi mixing bounds for kinetic samplers via L2 hypocoercivity
    Jianfeng Lu, Yinchen Luo
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
BibTeX
@misc{jiang2026adhesive,
  title = {{Adhesive riffle shuffles: one-parameter models and mixing bounds}},
  author = {Yunjiang Jiang},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.02092},
  eprint = {2611.02092},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.02092},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Adhesive riffle shuffles: one-parameter models and mixing bounds
AU  - Yunjiang Jiang
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.02092
UR  - https://arxiv.org/abs/2611.02092
AB  - We compare four simple shuffles with one adhesion parameter p: a card-weighted sticky riffle, a block-weighted riffle, a midpoint-interpolation shuffle, and a correlated-label inverse riffle. Independent surviving contacts create contiguous blocks; no force or energy constants are fitted. We give polynomial upper bounds with explicit dependence on p, common adjacency-survival lower bounds, and a sharper information lower bound for interpolation. For fixed deck size n≥4, the mixing time diverges as Θ((1−p)^−1) for the three cut-first models, but as Θ((1−p)^−2) for the correlated-label model. The latter distinction comes from whether one or two additional contact breaks are needed to escape cyclic rotations. For even n, unglued interpolation retains the lower bound Ω(√nlog n) and upper bound O(n^5/2log n). We distinguish proved bounds from conjectured scales, recover classical riffle cutoff under sufficiently small perturbations, and explain precisely where established results on clumpy shuffles apply. The fixed-parameter asymptotic orders of the new cut-first families and their possible cutoff remain unresolved.
ER  -