pith. sign in

arxiv: 2603.09008 · v2 · submitted 2026-03-09 · 🧮 math.PR · math.CO

On the statistics of random-to-top shuffles

Alexander Clay This is my paper

Pith reviewed 2026-05-15 12:48 UTC · model grok-4.3

classification 🧮 math.PR math.CO MSC 60C0560F0505A05
keywords random-to-top shufflefixed pointsdescentsinversionslimit theoremspermutation statisticscombinatorial decomposition
0
0 comments X

The pith

Iterated random-to-top shuffles yield limiting distributions for fixed points, descents, and inversions that coincide with those of uniform random permutations in two asymptotic regimes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves limit theorems for three classical permutation statistics after repeated random-to-top shuffles. It introduces combinatorial decompositions that express each statistic as a randomly indexed version of the same statistic on a uniform random permutation. These identities transfer known limit laws from the uniform case to the shuffle process and simultaneously supply new combinatorial derivations of the expectations for fixed points and inversions. The results settle an open question on fixed-point expectations and answer a prior query on inversion counts.

Core claim

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each statistic as a randomly indexed statistic of a uniformly random permutation. This perspective gives new combinatorial proofs of the expected number of fixed points and inversions. In particular, we solve an open problem of Pehlivan on fixed points, and we answer a question of Diaconis and Fulman on inversions.

What carries the argument

New combinatorial decompositions expressing each of the three statistics as a randomly indexed statistic on a uniformly random permutation.

If this is right

  • The expected number of fixed points after iteration admits a new combinatorial derivation.
  • The expected number of inversions after iteration admits a new combinatorial derivation.
  • The open problem on the limiting distribution of fixed points is resolved.
  • The prior question on the limiting distribution of inversions is resolved.
  • Limit laws for descents follow from the same decomposition technique.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same decomposition approach may extend to joint distributions of these statistics or to additional permutation statistics.
  • The technique could be applied to other Markovian shuffle models that admit a similar embedding into uniform permutations.
  • The results suggest that the random-to-top chain preserves the asymptotic independence properties of uniform permutations for these local statistics.

Load-bearing premise

The new combinatorial decompositions correctly represent the fixed-point, descent, and inversion counts after random-to-top iteration as randomly indexed versions of the same counts on a uniform random permutation.

What would settle it

An explicit computation or large-scale simulation of the distribution of fixed points after a number of random-to-top shuffles that deviates from the predicted Poisson or normal limit in either of the two regimes.

Figures

Figures reproduced from arXiv: 2603.09008 by Alexander Clay.

Figure 1
Figure 1. Figure 1: Histograms from 2000 trials of the number of fixed points of n = 10000- card decks after iterated random-to-top shuffles, normalized to form probability dis￾tributions. The overlays are linearly interpolated versions of the predicted Poisson– geometric convolutions from Theorem 1.1 in blue and a Poisson(1) distribution in orange. The top histogram corresponds to r = 5000 shuffles, the middle to r = 10000 s… view at source ↗
Figure 2
Figure 2. Figure 2: Histograms based on 2000 trials of the number of descents for n = 10000 under iterated random-to-top shuffles, centered by n(1−e −r/n) and scaled by n −1/2 , and normalized to form probability distributions. Top: r = 2500. Middle: r = 5000. Bottom: r = 10000. The cyan curves show the predicted limiting densities in the r = cn regime from Theorem 1.2, while the orange curves correspond to the N (0, 1/12) de… view at source ↗
Figure 3
Figure 3. Figure 3: Histograms of 1000 trials of the number of inversions of n = 1000 card decks after iterated random-to-top shuffles centered by n(1 − e −2r/n) and scaled by n −3/2 , normalized to form probability distributions. Top: r = 100 shuffles. Middle: r = 250 shuffles. Bottom: r = 1000 shuffles. The cyan curves are the predicted r = cn densities from Theorem 1.3. The orange curves are N (0, 1/36) densities. Let Wi =… view at source ↗
read the original abstract

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each statistic as a randomly indexed statistic of a uniformly random permutation. This perspective gives new combinatorial proofs of the expected number of fixed points and inversions. In particular, we solve an open problem of Pehlivan on fixed points, and we answer a question of Diaconis and Fulman on inversions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proves limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. The proofs are analytic and rely on new combinatorial decompositions that express each statistic as a randomly indexed version of the corresponding statistic on a uniform random permutation. This representation is used to transfer known limit laws and also supplies new combinatorial proofs of the expectations for fixed points and inversions, resolving an open problem of Pehlivan and a question of Diaconis and Fulman.

Significance. If the decompositions hold, the work provides a unified analytic framework for these permutation statistics under random-to-top shuffling. The ability to reduce the iterated-shuffle statistics to randomly indexed uniform-permutation statistics is a genuine technical contribution that yields both the limit theorems and the new expectation proofs. The resolution of the cited open questions adds immediate value to the literature on mixing times and permutation statistics.

minor comments (2)
  1. [Introduction] The two asymptotic regimes should be stated with explicit parameter ranges (e.g., number of shuffles relative to deck size) already in the introduction so that the reader can immediately distinguish the regimes before the technical sections.
  2. [Main theorems] In the statements of the limit theorems, the precise form of the limiting distributions (including any centering or scaling constants) could be written out explicitly rather than left implicit in the transfer argument.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. We are pleased that the combinatorial decompositions and their applications to limit theorems and expectation formulas were viewed as a genuine technical contribution.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper's central contribution consists of newly introduced combinatorial decompositions that express the fixed-point, descent, and inversion counts under iterated random-to-top shuffles as randomly indexed versions of the corresponding statistics on a uniform random permutation. These representations are then used to transfer known limit laws from the uniform case and to obtain new proofs of expectations, including solutions to open questions posed by Pehlivan and by Diaconis-Fulman. No step reduces by definition to the target result, no parameter is fitted to a subset and then relabeled as a prediction, and no load-bearing uniqueness theorem or ansatz is imported via self-citation. The derivation chain is therefore self-contained and independent of the final limit statements.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work relies on standard combinatorial facts about uniform random permutations and analytic limit theorems; no new free parameters or invented entities are introduced.

axioms (1)
  • standard math Standard properties of uniform random permutations and their statistics
    Invoked to justify the random-indexing decompositions.

pith-pipeline@v0.9.0 · 5364 in / 1223 out tokens · 35437 ms · 2026-05-15T12:48:10.829434+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages

  1. [1]

    Aldous and P

    D. Aldous and P. Diaconis,Shuffling cards and stopping times, Amer. Math. Monthly93(1986), 333–348

    work page 1986

  2. [2]

    Arcona,Representation theory and cycle statistics for random walks on the symmetric group,https://arxiv

    D. Arcona,Representation theory and cycle statistics for random walks on the symmetric group,https://arxiv. org/pdf/2512.13969, 2025, arXiv preprint

    work page arXiv 2025

  3. [3]

    Arratia and S

    R. Arratia and S. Tavar´ e,The cycle structure of random permutations, Annals of Probability20(1992), no. 3, 1567–1591

    work page 1992

  4. [4]

    Athanasiadis and P

    C. Athanasiadis and P. Diaconis,Functions of random walks on hyperplane arrangements, Adv. Appl. Math.45 (2010), 410–437

    work page 2010

  5. [5]

    Bayer and P

    D. Bayer and P. Diaconis,Trailing the dovetail shuffle to its lair, Ann. Appl. Probab.2(1992), 294–313

    work page 1992

  6. [6]

    Borga, P

    J. Borga, P. Diaconis, and S. Chatterjee,Permuton and local limits for the luce model,https://arxiv.org/pdf/ 2509.07729, 2025, arXiv preprint

    work page arXiv 2025

  7. [7]

    Chatterjee and P

    S. Chatterjee and P. Diaconis,A central limit theorem for a new statistic on permutations, Indian Journal of Pure and Applied Math.48(2018), 561–573

    work page 2018

  8. [8]

    Chatterjee, P

    S. Chatterjee, P. Diaconis, and G. Kim,Enumerative theory for the tsetlin library, Journal of Algebra655(2024), 139–162. 26 ALEXANDER CLAY

    work page 2024

  9. [9]

    Diaconis, J.A

    P. Diaconis, J.A. Fill, and J. Pitman,Analysis of top to random shuffles, Combinatorics, Probability and Com- puting1(1992), 135–155

    work page 1992

  10. [10]

    Diaconis and J

    P. Diaconis and J. Fulman,The mathematics of shuffling cards, AMS, 2023

    work page 2023

  11. [11]

    Durrett,Probability: Theory and examples, 5 ed., Cambridge University Press, Cambridge, 2019

    R. Durrett,Probability: Theory and examples, 5 ed., Cambridge University Press, Cambridge, 2019

    work page 2019

  12. [12]

    Ferrante and M

    M. Ferrante and M. Saltalamacchia,The coupon collector’s problem, Materials Matem` atics2014

    work page

  13. [13]

    Fulman,The distribution of descents in fixed conjugacy classes of the symmetric groups, Journal of Combina- torial Theory, Series A84(1998), 171–180

    J. Fulman,The distribution of descents in fixed conjugacy classes of the symmetric groups, Journal of Combina- torial Theory, Series A84(1998), 171–180

    work page 1998

  14. [14]

    ,Stein’s method and non-reversible markov chains, IMS Lecture Notes Monogr. Ser. (2004), 66–74

    work page 2004

  15. [15]

    ,Fixed points of non-uniform permutations and representation theory of the symmetric group,https: //arxiv.org/pdf/2406.12139, 2024, arXiv preprint

    work page arXiv 2024

  16. [16]

    Hoeffding and H

    W. Hoeffding and H. Robbins,The central limit theorem for dependent random variables, Duke Math. Journal 15(1948), 773–780

    work page 1948

  17. [17]

    Jonasson,Biased random-to-top shuffling, Ann

    J. Jonasson,Biased random-to-top shuffling, Ann. Appl. Prob.16(2006), 1034–1058

    work page 2006

  18. [18]

    Kim,Distribution of descents in matchings, Annals of Combinatorics23(2019), 73–87

    G. Kim,Distribution of descents in matchings, Annals of Combinatorics23(2019), 73–87

    work page 2019

  19. [19]

    Kim and S

    G. Kim and S. Lee,Central limit theorem for descents in conjugacy classes ofs n, Journal of Combinatorial Theory, Series A169(2020)

    work page 2020

  20. [20]

    Liu and M

    K. Liu and M. Yin,Descents and flag major index on conjugacy classes of colored permutation groups without short cycles, Electronic Journal of Combinatorics32(2025), 3–47

    work page 2025

  21. [21]

    J.C. Loth, M. Levet, K. Liu, E.N. Stucky, S. Sundaram, and M. Yin,Permutation statistics in conjugacy classes of the symmetric group,https://arxiv.org/abs/2301.00898, 2023, arXiv preprint

    work page arXiv 2023

  22. [22]

    Margolius,Permutations with inversions, Journal of Integer Sequences4(2001)

    B. Margolius,Permutations with inversions, Journal of Integer Sequences4(2001)

    work page 2001

  23. [23]

    Pehlivan,On top to random shuffles, no feedback card guessing, and fixed points of permutations, (2009), PhD Thesis

    L. Pehlivan,On top to random shuffles, no feedback card guessing, and fixed points of permutations, (2009), PhD Thesis

    work page 2009

  24. [24]

    Ross,Fundamentals of stein’s method, Probability Surveys8(2011), 210–293

    N. Ross,Fundamentals of stein’s method, Probability Surveys8(2011), 210–293

    work page 2011

  25. [25]

    Schramm,Compositions of random transpositions, Israel Journal of Mathematics147(2005), 221–243

    O. Schramm,Compositions of random transpositions, Israel Journal of Mathematics147(2005), 221–243

    work page 2005

  26. [26]

    van der Vaart,Asymptotic statistics, Cambridge University Press, 1998

    A.W. van der Vaart,Asymptotic statistics, Cambridge University Press, 1998

    work page 1998

  27. [27]

    Weiss,Limiting distributions in some occupancy problems, The Annals of Mathematical Statistics29(1958), no

    I. Weiss,Limiting distributions in some occupancy problems, The Annals of Mathematical Statistics29(1958), no. 3, 878–884. Department of Mathematics, University of Southern California (USC), Los Angeles, CA, USA. Email address:ajclay@usc.edu

    work page 1958