WorksMathematics
Adhesive riffle shuffles: one-parameter models and mixing bounds
Abstract
We compare four simple shuffles with one adhesion parameter : 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 , common adjacency-survival lower bounds, and a sharper information lower bound for interpolation. For fixed deck size , the mixing time diverges as for the three cut-first models, but as 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 , unglued interpolation retains the lower bound and upper bound . 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.
Status and scope. This is an AI-assisted working manuscript, not a refereed publication. The bounds proved here are the bounds established in this draft, not claims of optimality in or of best-known results for every related shuffle. Standard spectral inputs and external mixing theorems are identified. Finite computations are diagnostics, not proofs of asymptotic statements. The historical survey is selective, checked through October 18, 2026; there is no claim of priority, experimental calibration, or exhaustive literature coverage. The parameter is fixed; latent contact and label randomness is refreshed every round. Persistent electrical charge is outside the Markov models studied here.
Introduction and historical context
From a physical shuffle to a random walk
The question “how many shuffles suffice?” is not well posed until the shuffle law, the notion of randomness, and the distance from a target law have been specified. A labelled deck has possible orders. A label-independent shuffling rule is a random walk on , and uniform measure is stationary because each individual move is a permutation. Stationarity alone says neither that the walk reaches every order nor how quickly it forgets its initial state. Modern treatments organize these questions through mixing times, coupling, stopping times, entropy, and spectral analysis; see Aldous–Diaconis [2] and Levin–Peres [17]. Diaconis–Fulman [7] give a broad account of the mathematics of card shuffling.
Two benchmarks illustrate why the mechanism matters. The random-transposition walk chooses positions throughout the deck, while adjacent-transposition walks move cards locally. Diaconis–Shahshahani [11] established sharp mixing for random transpositions using representation theory. For local shuffling, Wilson [26] developed sharp-scale bounds and Lacoin [15] proved cutoff for the adjacent-transposition shuffle. The time conventions in these papers differ: one discrete adjacent update per round is not the same clock as independent rate-one updates at every edge. We will specify our clocks whenever comparing chains.
Riffle shuffling and cutoff
The classical Gilbert–Shannon–Reeds (GSR) model draws , cuts off the first cards, and then chooses uniformly among the interleavings preserving both packet orders. Its equivalent binary-word description gives independent fair input bits. The historical model and equivalent constructions are discussed by Aldous–Diaconis [2], who trace the model to Gilbert and Shannon in 1955 and Reeds in 1981, and by Diaconis–Fulman [7]. Here “Reeds” refers to Jim Reeds, not to Reed–Solomon error-correcting codes. In the forward construction the next packet is selected by its remaining card count, not by a fixed fair coin.
Bayer–Diaconis [5] analyzed the distribution through rising sequences and established the sharp transition at shuffles. The familiar slogan about seven shuffles is a finite-deck summary, not a statement that seven steps produce exact uniformity. The distinction between gradual convergence and an asymptotically abrupt transition is the cutoff phenomenon.
Card-shuffling problems helped make cutoff a central question in finite Markov-chain theory. The random-transposition analysis of Diaconis–Shahshahani [11] and the stopping-time approach of Aldous–Diaconis [2] supplied complementary algebraic and probabilistic methods. Diaconis’s survey [8] places shuffling alongside urn models and other walks, including examples with no cutoff. Polynomial mixing, a spectral gap, or a plausible entropy threshold alone does not establish a sharp transition.
Lalley [16] connected riffle permutations to symbolic and interval dynamical systems and related randomization to entropy. This viewpoint motivates studying geometric interleaving rules, but random point configurations in a geometric representation must not be confused with resetting packets to deterministic equally spaced grids. The two constructions need not have the same law.
Recent work of Sellke, Shi, and Wang [24] proves cutoff for broad classes of cut-size distributions. Their interleaving is still uniformly random conditional on the cut. Thus randomness of the cut alone is not the assumption that distinguishes their setting from ours: it is the conditional interleaving law. Their theorem does not supply an upper bound for the chain studied here.
Perfect shuffles, Thorp shuffling, and sparse randomness
A perfect shuffle interlaces equal packets in a prescribed alternating pattern. Such permutations have rich algebraic structure but do not, by themselves, constitute a mixing mechanism. Diaconis, Graham, and Kantor [9] study the groups generated by perfect shuffles. Thorp’s work on nonrandom shuffling and faro [25] is an early motivation for distinguishing realistic or structured shuffling from uniform random permutations.
In the Thorp shuffle, the deck is cut exactly in half, and each corresponding pair of cards is ordered by an independent fair coin. Conditional on an exactly balanced cut, our shuffle is precisely this operation. Morris’s first polynomial-in-log bound appeared in work originating at STOC 2005 and published in 2008 [18]. Morris [19] obtained for arbitrary even by an entropy method for shuffles built from random pair exchanges. For , Morris [20] subsequently obtained .
An October 3, 2026 preprint of Jiang [12] reports a full-deck upper bound of order for the power-of-two Thorp shuffle. This recent preprint is included for bibliographic currency; its proof is not audited or used here. In particular, our argument does not depend on the best available Thorp mixing bound.
Comparison methods and the present contribution
Comparison of Dirichlet forms and spectra is a standard way to transfer mixing estimates between walks on groups; Diaconis–Saloff-Coste [10] provide a foundational treatment. Our application has a nonreversible complication: the proportional shuffle is not a reversible walk, so controlling only the eigenvalues of an additive symmetrization would not suffice. We instead control its one-step squared-norm deficit on invariant spectral subspaces.
A second ingredient comes from a different subject. The detectability lemma, introduced by Aharonov, Arad, Landau, and Vazirani [1], bounds products of local projections. We use the arbitrary-order version of Anshu, Arad, and Vidick [4] to compare parallel swap layers with the sum of their individual swap projections. The state space here is classical; only the Hilbert-space inequality is borrowed.
For unglued interpolation, the model-specific observations are an exact tie count and a two-cut geometric identity. The identity turns the balanced-cut matching and one conjugate matching into a Hamiltonian cycle. It permits a polynomial upper bound without waiting for a long uninterrupted run of balanced cuts. We also obtain an information-concentration lower bound, stronger than a fixed-error entropy inequality. The substantial gap between the two bounds is part of the conclusion, not a suppressed technical issue.
For the adhesive extensions, local alternatives supply fair-swap projections along a path. A separate comparison uses rotations and one-break insertions when adhesion is strong. The model atlas and bounds come first; the unglued proof develops the common spectral tools; § 8–§ 11 then give the parameter-dependent arguments. This organization distinguishes baseline results, uniform bounds, and genuinely sharp fixed-deck parameter exponents.
Physics motivates blocks, not an uncalibrated force law
Surface-charge correlations can contribute to adhesion between insulating surfaces [23]. Experiments on insulating polymers also link charge to friction [6], while the mechanics of interleaved paper exhibits strong geometry-dependent friction amplification [3]. These are motivations for allowing coherent groups of cards, not measurements of a playing-card shuffle. Sticking need not be electrical, and a net positive or negative charge per card does not describe all surface-charge effects. We do not insert a thermal Boltzmann factor into a macroscopic, hand-driven process.
Our coarse-graining keeps just one probability: is the chance that an existing neighboring contact survives the release attempt. Broken contacts permit, but do not force, separation in the output. Humidity, coating, pressure, and handling would affect an experimentally fitted ; they are not extra mathematical parameters here. Independent contacts, equal card thickness, and complete refresh between shuffles are simplifying assumptions, not consequences of electrostatics. The cut-first models also impose the cut independently of adhesion. Persistent charge would require an enlarged state space and a new stationarity argument.
Clumpy shuffles and the cut-law distinction
Jonasson and Morris [13] prove mixing for a riffle driven by a stationary, symmetric two-state Markov word, with any fixed nondegenerate transition probability. Their paper cites earlier work by Wager on an extremely clumpy regime; we have not independently checked that thesis and make no novelty claim in this regime. Our correlated-label family below is exactly their model, up to inversion and parameterization. Our other three families keep a binomial cut and are different chains. In particular, their polylogarithmic theorem is not an upper bound for those cut-first families.
Contiguous random packets also appear in the overhand-shuffle literature. Pemantle [22] proved bounds between orders and ; Jonasson [14] established the latter as the correct order for that model. Its packet-reversal mechanism is different from preserving two packets while interleaving their blocks. Palomares’s 2025 REU report [21] studies the Markovian rule under the name “geometric model,” with a neatness parameter and finite-deck spectral calculations. That use of “geometric” refers to run lengths, not our deterministic midpoint grids. Neither resemblance transfers a mixing theorem to the cut-first models.
A model atlas: one adhesion parameter, four rules
Throughout the extension let and . These are not two parameters. Card identities never affect the rule. All random choices are fresh at each shuffle. The parameter is contact survival, not the probability that two successive output cards come from the same packet.
The common cut-first mechanism
The families , , first draw and form packets of and cards. Empty cuts are the identity. At each internal packet gap independently, keep the bond with probability . The connected components are blocks; each block keeps its internal order. Conditional on ,
Before boundary truncation, block lengths have law and mean for .
Definition 2.1 (Card-weighted release: ). With cards left in the packets, choose the next left block with probability and otherwise the next right block. Release the whole selected block and subtract its length from the packet count. Equivalently, after each individual card immediately update the counts. If both packets remain nonempty, test the next bond on the last-used side: with probability continue on that side, and with probability make a fresh card-weighted GSR choice. Thus, with measured after drops and the last side, the next-left probability is
An empty packet cannot supply another card; the first drop has no previous side and uses . A failed bond can still be followed by a fresh choice of the same side.
Definition 2.2 (Block-weighted release: ). With blocks remaining, choose the next left block with probability . Conditional on the packet partitions, all order-preserving block interleavings are equally likely. Blocks of unequal lengths have equal selection weight. This is deliberately not card-weighted GSR. Nor is its cut binomial in the number of blocks: the initial cut was made in cards.
Definition 2.3 (Midpoint release: ). A block at packet positions in a packet of cards has key . Merge blocks in increasing key order. Independent fair coins resolve equal keys, and each block is emitted intact. The keys use card positions, not block ranks. This is a release schedule approximation, not an independently calibrated mechanical clock.

Figure 1. The three cut-first families share precisely the same cut and bond law. Only the block interleaver changes.
For example, consider packet blocks [1, 2, 3, 4] and [5], [6], [7], [8]. The first-left probability is 1/2 for and 1/5 for . The rule instead gives 5, 6, 1, 2, 3, 4, 7, 8 deterministically. This example is conditional on a partition; it introduces no new parameter.
The correlated-label benchmark has a different cut
Definition 2.4 (Markov inverse riffle: ). On the uncut deck keep each neighboring bond independently with probability , give each resulting block an independent fair binary label, and stably place label 0 before label 1. Equivalently, start with a fair label and, at each next position, repeat the label with probability .
The label-switch indicators in this construction are independent Bernoulli(). In the corresponding forward shuffle the number of zeros is the cut size. Its variance is
because label correlations at distance equal . Except at , this cut is not binomial. Reversing iid permutation increments preserves the distance to uniform, so forward and inverse versions have identical mixing times. This is the connection with [13].
| Family | What is randomized? | At | At |
| Card-weighted block choices | GSR | Rotations only | |
| Uniform block interleaving | GSR | Rotations only | |
| Bonds and midpoint tie coins | Original interpolation | Rotations only | |
| Correlated binary labels | Inverse GSR | Identity only |
Table 1. All four families have at most one adjustable parameter. The infinitesimal continuous jitter considered later is an equivalent implementation of , not a fifth tunable model.
Every family is a walk with iid, label-independent permutation increments, so uniform measure is stationary. The upper bounds below prove convergence for on even decks, and for on odd decks as well. At , the GSR families mix on either parity; our upper arguments leave odd-deck interpolation untreated. At , the rotation subgroup is proper when , so stationarity does not imply convergence from a fixed deck.
Reading the bounds
Use total variation from a specified starting order, uniform target measure, and one complete shuffle per time unit. Write
At mixing on fails for . The following table concerns . Constants in and are absolute unless a subscript says otherwise. Lower bounds concern ; upper bounds allow . The polynomial cut-first upper bounds assume even ; the common rotation bound below also covers odd when .
The entropy quantity is explicit in (23). The Markov bound holds for all ; for fixed the stronger external bound is available from [13].
Three refinements are important when interpreting Table 2. First, for all cut-first families and we prove
| Family | Lower bound established here | Parameter-explicit polynomial upper bound |
| , | ||
Table 2. Proved bounds, not proposed sharp scales.
This is particularly useful when is bounded, and must not be used as a fixed- polynomial bound. Second, interpolation also satisfies
Take the minimum of all applicable upper bounds, not their sum. Third, at the classical GSR families have the much sharper bound and cutoff [5]. The constants in the table are deliberately conservative.
Theorem 2.5 (Sharp adhesion exponents at fixed deck size). Fix and . As ,
The -dependent constants are not asserted to be sharp. These are fixed- parameter asymptotics, not a cutoff assertion.
The proof is given after the uniform upper and lower estimates. In the joint regime , (4) improves the cut-first upper bound to for sufficiently large . Its lower counterpart is . For the Markov model the corresponding bounds are and . Large gaps in remain visible.
The unglued interpolation model and its bounds
Midpoint interpolation
Number the positions . Given a cut with , write the two packets as and , in their current orders. Assign coordinates
Merge by increasing coordinate. Whenever , use an independent fair coin to decide whether or comes first. Cuts and are the identity. Coordinates and random choices are reset at every round.
Definition 3.1. The binomial-cut proportional shuffle is the preceding merge with independent cuts at successive rounds. The name is descriptive, not a claim that this is established terminology.
There are at most two cards at any coordinate, and distinct ties involve disjoint cards. The packet orders are always preserved. The midpoint convention matters: different endpoint or rounding conventions can yield different chains and different invariants.
Proposition 3.2 (Equivalence with infinitesimal jitter). Fix . Add independent perturbations to all coordinates in (6) before merging. The resulting shuffle has exactly the law of independent fair tie-breaking.
Proof. A nonzero difference of cross-packet coordinates is an integer multiple of , hence has magnitude at least . The difference between two perturbations is smaller than , so no strict cross-packet comparison changes. Within a packet the spacing is at least , which likewise cannot be reversed. At a tie, exchangeability of the two continuous perturbations gives either order with probability . Disjoint tied pairs use disjoint noises, giving independence.
Remark 3.3. Independent two-point noises leave a tie unresolved with probability . Stable left-first sorting would then favor the left card with probability . One can instead give each tied pair opposite signs, with one fair coin choosing the signs. That is again exactly our model. Noise large enough to change non-tied comparisons is a different model; none of the main results silently assumes such additional noise.
Distances and conventions
Let be uniform measure on and let start from the identity deck. Set
Every deterministic starting order has the same distance by translation. Entropies use base-two logarithms; unmarked log denotes the natural logarithm. The unglued interpolation results in the next five sections concern even ; the extension states its size restrictions separately.
Theorem 3.4 (Main bounds). Let be even and let be the number of ties at cut . Define
Then:
and .
For every fixed ,
For and , a universal constant satisfies
The constants in the upper bound are not optimized.
The third assertion follows from a more general statement. Write for the specified fair-tie merge conditional on cut .
Theorem 3.5 (Two-cut criterion). Let and let for an arbitrary cut law with . Then
No assumption on the remaining cut probabilities is needed.
For the binomial law, and , which gives Theorem 3.4(3). The case is a two-state chain and is elementary.
The lower bound already confirms a qualitative difference from the benchmarks: this even-deck chain mixes asymptotically more slowly than both GSR riffle shuffling and the Thorp shuffle. Indeed, its lower bound exceeds both the GSR logarithmic scale [5] and the general-even Thorp upper bound [19]. This comparison is asymptotic, not a numerical prediction for a 52-card deck.
Tie arithmetic and the entropy of one round
Lemma 4.1 (Exact tie count). For , put , , and . Then
Also .
Proof. The tie equation is . Since and are coprime, both must be odd for a solution. If they are odd, the solutions are and , with . There are exactly solutions.
For , . A nonzero tie count requires , so
The latter follows because a positive divides both and . If is odd there are no ties at all. If , every interior cut has .
Lemma 4.2 (The balanced cut dominates). For and ,
where is Euler’s totient and counts positive divisors. Consequently,
Proof. Write . The positive-index sequence is decreasing and . For every divisor of , grouping consecutive positive indices gives
Use (9) and to obtain (10). Also . The elementary divisor bound , or just , makes the error . For completeness, the latter estimate follows by writing : for , , while the finitely many smaller primes contribute a bounded factor to . Finally Stirling’s formula gives . □
Remark 4.3 (Input entropy is not automatically deck entropy). The effective seed for one step consists of the cut and the tie coins. Its entropy is exactly . Different seeds may produce the same permutation, so the entropy of the one-step permutation is only bounded above by . After rounds the deck entropy is at most . There is no assertion that all input information is retained efficiently.
The exactly balanced cut occurs with probability of order and uses coins. These relatively rare, high-entropy rounds dominate the leading entropy budget. Thus it would be incorrect to count only possible moves per round, as one could for deterministic tie rules.
A strong information lower bound
An entropy inequality alone gives a fixed-error lower bound. Concentration of the information of the entire input history gives distance tending to one, which is the stronger conclusion needed for the lower side of a possible cutoff.
Lemma 5.1 (Information moments). Let and define
Then and for even .
Proof. Conditional on , each tie-coin string has probability , which proves the mean assertion. For a variable on possible values, its surprisal satisfies . Integrating this tail with gives . By (9),
Now use .
Proof of Theorem 3.4(1)–(2). Part (1) follows from Lemma 4.2 and Stirling’s formula for . Put and . The information of a full history of cuts and tie coins is
a sum of independent copies. Hence
Chebyshev’s inequality implies
Every history in this event has probability at least , so there are at most such histories. Their resulting decks form a set with the same cardinality bound. Therefore
and total variation tends to one.
Proposition 5.2 (A finite-deck entropy bound). If , then
where .
Proof. Couple to a uniform permutation with disagreement probability . Conditioning on the disagreement indicator bounds the missing entropy by . Combine this with .
Two cuts produce a cycle of random-swap locations
Let . A permutation will mean the output list of the midpoint merge at cut , with all ties resolved left before right. Thus maps an output position to its input position. Permutations compose as functions: .
Let be the balanced input matching
Write for the group generated by these disjoint transpositions, put , , and set .
Lemma 6.1 (Two-cut geometry). The following hold.
The conditional permutation at cut is , with uniform on .
At cut there is either no tie or one tie, and any tie is an edge of .
and are disjoint perfect matchings whose union is a Hamiltonian cycle on the input positions.
Proof. The first assertion is the definition of the balanced merge. At cut , the packet sizes are and . If is odd, Lemma 4.1 gives no tie. If is even, there is exactly one, between input positions and , an edge of .
For the last assertion, pairs consecutive output positions. Thus consists of consecutive pairs in the list . Set . Direct comparison of midpoint coordinates shows that those pairs are
One way to check the list is to note that lies between and when , and between and when . At equality the prescribed left-first convention places first.
Contract each edge of to vertex . The displayed pairs become exactly . For this is the two-edge cycle as a multigraph. Hence the original union of the two matchings is connected and two-regular, and is therefore one cycle of length . □

Figure 2. For , the balanced cut 4 and adjacent cut 5 produce the alternating cycle 1, 5, 8, 4, 7, 3, 2, 6, 1. This is a geometric identity between matchings, not an assumption that balanced cuts occur consecutively.
This also proves irreducibility for any cut law charging and : the group generated by the support contains , , and , hence and all transpositions in . Transpositions along a connected graph generate . For the binomial chain, the identity has positive probability, so aperiodicity follows immediately. The quantitative argument below also handles the two-cut law without an explicit identity atom.
A polynomial upper bound
Operators and the nonreversible deficit
Work in and let . Then and is unitary. For a matching , define its averaging projection
The factors commute; is the orthogonal projection onto invariance under independently swapping the matched pairs.
Let be the transition operator in Theorem 3.5 and its adjoint. Put and . Conditional on the two distinguished cuts,
where or for a transposition . In particular , and .
Define the nonnegative norm deficit
For any mixture of contractions, the variance identity gives
Lemma 7.1 (Control of two parallel layers). With and ,
Proof. Put and . Equation (11) implies
For the second inequality, retain the two distinguished terms of the weighted variance and minimize their common center; their coefficient is .
Multiplication by shows . Consequently
Since ,
Its square is at most . Averaging this with the bound for gives (12) (in fact suffices).
From a cycle to the central transposition generator
For any transposition edge , let , an orthogonal projection. The cycle Hamiltonian is
The terminology “Hamiltonian” here means only a sum of positive self-adjoint operators. Define the central random-transposition generator
It generates a continuous-time walk making one uniformly chosen transposition per unit time on average. The continuous clock avoids the parity periodicity of a discrete walk that always transposes.
Lemma 7.2 (Path comparison). As quadratic forms,
Proof. Delete one cycle edge to obtain a path. A transposition of vertices at path distance is a word of length in adjacent transpositions, each path edge used at most twice. Telescoping and Cauchy–Schwarz give
Each fixed edge lies in at most such paths. Average over the pairs, using and . The resulting coefficient is at most . This is an elementary instance of the path comparison method [10].
The next input prevents losing a further factor of when replacing the individual edge projections by simultaneous matching updates.
Lemma 7.3 (Projection-product input). Suppose orthogonal projections each fail to commute with at most two others. Let be the product of their complements, each applied once in any order; this includes any grouping into commuting layers. On a common invariant subspace where , one has
This is the detectability-lemma estimate of Anshu–Arad–Vidick [4 Lemma 2], applied with noncommutation degree two. More precisely, their energy form of the lemma applies on the invariant subspace even if the restricted sum has no zero eigenvalue. No tensor-product assumption on is needed. In our cycle, disjoint transpositions commute and each edge has just two neighboring edges, so the hypothesis holds.
Lemma 7.4 (Central spectral comparison). For every ,
Moreover the same inequality holds on every eigenspace of , and these eigenspaces are invariant under .
Proof. The sum of all transpositions is central in the group algebra. Thus every , and hence every operator under consideration, preserves each eigenspace of , whose eigenvalues lie in . By Lemma 7.2, . Lemma 7.3 implies
In particular, . On the other hand, writing and ,
Therefore . Combining with Lemma 7.1 gives ; the stated constant is weaker. Orthogonal decomposition into the gives the result for arbitrary .
Why the full spectrum gives the improved bound
Using only a spectral gap and the smallest stationary mass would lose an unnecessary factor comparable to . Instead we retain all central spectral subspaces.
Lemma 7.5 (Random-transposition input). For the continuous-time chain generated by (13), let be the squared distance of its density from , starting at the identity. There is a universal constant such that
Proof. We give a nonsharp spectral-sum bound to make the required estimate explicit. The classical representation-theoretic formulas for random transpositions [11] index the spectrum by partitions of . If is the irreducible dimension and the conjugate partition, the eigenvalue of the transposition averaging operator is
with multiplicity . Consequently
Put . Since all row lengths are at most ,
Deleting the first row leaves a partition of . A standard tableau of shape is determined by the entries below its first row and a standard tableau of shape ; column constraints can only reduce the count. Thus and, using ,
It follows that
For , the right side is at most when . In particular suffices. □
The preceding estimate uses the full spectral sum, not merely its smallest positive eigenvalue. It is weaker than the sharp classical random-transposition analysis, but suffices for our comparison.
Proof of Theorem 3.5. Set . By Lemma 7.4,
Let be the density of the initial point mass. The squared norm of its projection onto is . Indeed, the spectral projector commutes with all translations, so its diagonal is constant and its trace is its rank. The density after steps is . Consequently,
Use and Lemma 7.5. More explicitly, the estimates give
which proves (7). This argument establishes convergence even without separately imposing aperiodicity on the two-cut law.
Remark 7.6 (What is and is not compared). The proof does not assert that interspersing arbitrary moves can only accelerate Thorp shuffling, nor does it thin the trajectory to balanced cuts. Both would require additional justification. It compares the actual one-step contraction of the full chain, including all intervening moves, to a central operator. The use of , rather than an unjustified reversible replacement for , is essential.
Lower bounds for the adhesive families
A universal information floor
Each cut-first increment is an ordinary order-preserving two-packet interleaving, irrespective of its probability. There are at most such increments, counted by their binary output words. The same support bound holds for their inverses, including . Consequently,
This gives without identifying seed entropy with the entropy of the output permutation.
Circular adjacency is the correct observable
Let count original directed circular neighbors that remain neighbors in , including the bottom-to-top edge. Then and
Circular rather than linear adjacency matters: a rotation leaves unchanged.
Proposition 8.1 (Finite adhesion lower bounds). Put . For any cut-first family and ,
For one has
In addition, for all four families, every integer satisfies
Proof. For a nonempty cut, let be the number of broken internal bonds. It has law . If , the shuffle is a rotation. Otherwise at most circular edges can be destroyed: all block interiors survive, and only block boundaries are candidates. This bounds the loss of original edges as well, even if some are later recreated. Summing expected losses gives . Apply the variational definition of total variation to the function and use (19).
For , use the number of switches of the Markov label word, not the number of hidden adhesive blocks. Here . With zero or one switch the increment is a rotation or the identity. Otherwise at most edges change, and . This proves (21). The coarser estimate is also valid for all four families, by counting broken adhesive bonds.
For the last assertion, preassign independent Bernoulli coins to each original directed edge in each round, even after that edge is lost. Whenever the edge is currently an internal packet contact, use its assigned coin for that bond. This preserves the model’s independent bond law. There are at most two exempt circular boundaries per round in a cut-first model and at most one in the inverse model. An original edge whose coins all survive cannot disappear unless it encounters an exempt boundary. At most distinct original edges can encounter such a boundary before being lost. Therefore, on this enlarged space,
No independence between and the chosen boundaries is needed. Under uniform measure, Markov’s inequality and (19) give , proving the claim.
Corollary 8.2 (Uniform order lower bounds). As , uniformly over , all four families satisfy . The inverse Markov family also satisfies .
Proof. When , , so use (18). Suppose and write . If is bounded, the coarse expected-loss bound in the preceding proof gives , as needed. For , take . Since , , and uniformly for ,
Also . Binomial concentration, with , makes the right side of (22) tend to one. Values of in a fixed bounded interval are already covered by the expected-loss bound. Combining the bounds proves the uniform order assertion. The additional Markov bound follows directly from (21).
Interpolation retains a stronger small-adhesion obstruction
Let be the number of block-key ties in one round, and define . A complete effective seed consists of the cut, the bond coins actually used, and the fair block-tie coins. Its entropy is
Here and below . A useful explicit upper bound is
The quantities and are the finite binomial sums already given for the unglued model.
Proposition 8.3 (Parameter-dependent information bound). One has . For ,
For every sequence and fixed ,
For even , if , the original leading lower scale is therefore unchanged.
Proof. A tie involving two singleton blocks was already an unglued tie. Every other tie uses a nonsingleton block, and there are at most as many such blocks as surviving bonds. Also . Taking expectations proves (23). The entropy argument of Proposition 5.2 then proves (24).
For completeness, the information-concentration argument remains uniform in , even when tends to an endpoint. Write the one-round surprisal as . The cut term has variance by Lemma 5.1. A single Bernoulli surprisal has variance , uniformly bounded for . Conditional on a nonempty cut there are exactly such variables. Empty cuts add at most to the variance. Finally . The inequality for the variance of a sum yields
For as in (25), the total seed surprisal has mean at most and variance at most . Chebyshev’s inequality makes its upper deviation by have probability . Histories below this threshold have at most outputs, whose uniform mass tends to zero. This proves (25). At the stated small- scale, , so for even $n.
Local collision bounds: polynomial dependence on deck size
The proof method is deliberately common to the four families. A local alternative that exchanges two input cards supplies a random-swap projection. Three layers of such alternatives connect the deck along a path. Keeping the full central transposition spectrum then avoids a factor of order in the final mixing bound.
Extracting fair swaps without requiring a rare global event
Lemma 9.1 (Random-subset projection extraction). Let be a matching. Suppose an increment law can be sampled by first choosing auxiliary data, including , *and then independent fair
swaps on the edges of , acting on the input of a fixed remaining permutation. If every has , then its adjoint norm deficit satisfies
It suffices that the two local alternatives for an edge have masses : their common part supplies a fair swap with total mass ; unmatched mass is retained as a separate outcome.
Proof. Conditionally the adjoint is , so the conditional deficit is . Mixture variance can only increase it. The commuting involutions associated to are simultaneously diagonalizable. On a nonconstant matching character with nonempty support , equals one precisely when . This event has probability at least , by considering any one . This proves the quadratic-form inequality. Splitting two atoms into an equal common mass and residual masses proves the last assertion. Independence of the activation events is not required.
In applications with several disjoint local windows, fix the exterior data and group outcomes into orbits of the window flips. Each flip leaves the input counts at the beginning and end of its window unchanged. For card-weighted release the likelihood therefore factors into local window likelihoods and an unchanged exterior likelihood. For uniform block interleaving it is constant on each orbit. For Markov labels, separated windows are conditionally independent given the exterior labels. These facts justify independent common-part extractions within a layer. We never demand that all the windows be active simultaneously.
Lemma 9.2 (Three path layers). Suppose are matchings partitioning the edges of a Hamiltonian path, and for each . Then
Proof. Let and . The path comparison of Lemma 7.2 still gives , where . On a central eigenspace , Lemma 7.3 bounds the product and gives loss at least . If , its loss is at most
Thus on . All relevant operators preserve these spaces. The spectral sum (16), at time , proves (27).
The polynomial estimates
Theorem 9.3 (Explicit local upper bounds). For even let . Define
For with ,
For all and ,
Common cut-first geometry. Condition on and denote input cards in the two packets by and . Use the matching and split into odd and even . Together these form the path . The gadgets for a fixed parity use disjoint two-position windows. It suffices to prove activation probability at least for each edge; multiplying by the cut probability and applying Lemma 9.2 then gives (31). □
Interpolation activations. If are singleton blocks, their tied midpoint keys give a fair swap of . At most four bonds must break, so the activation probability is at least .
For an edge isolate positions in both packets by breaking their external bonds, an event of probability at least . Write , , , . If the two internal bonds break and both ties put left first, the local output is , with conditional mass . If both internal bonds survive and the tied two-card blocks put left first, it is , with mass . These outputs differ by exactly the input swap . Blocks outside the isolated window have keys outside its key interval and hence do not interfere. Common-part extraction activates the swap with probability at least . Disjoint windows have independent internal choices after the external bonds are fixed. Lemma 9.1 applies to each layer. □
Card-weighted activations. Conditional on the bond partitions, realize the interleaver by two independent continuous-time packet processes. A packet with cards remaining waits an exponential time of rate , then emits its next whole block. Competing exponential clocks give exactly the probability ; the construction is a proof device, not a new model parameter.
Isolate a two-position window as four singleton cards, requiring at most six broken bonds. Let . In one packet let be the time at which its prefix of cards has been emitted. The rates visited before this time are a subset of , whence
The two prefix times are independent and identically distributed under the imposed bonds. Divide into bins of width , including an endpoint bin. There are at most bins since . At least half of the probability lies in this interval; if its length is zero, both prefix times are zero. Cauchy–Schwarz gives probability at least that both times lie in one bin. The earlier ready packet waits for the later one with conditional probability at least , since its current rate is . Thus with probability at least , both window heads are exposed before either is emitted.
At that moment both packets contain cards. Each of the local orders and has conditional probability at least . This follows directly by multiplying the four card-count ratios; the remaining counts differ by at most two, and the cases only force some of the choices. After these four singleton releases both orders leave the same state. Their common part therefore activates with probability at least .
For use a one-position singleton window, at most four broken bonds, and the two orders and . The same prefix argument applies with , and each order has at least least 1/4. Its activation probability is larger than . For a layer, local flips preserve its good windows and all their entry and exit counts; the likelihood factorization preceding Lemma 9.2 justifies simultaneous fair extraction.
Block-weighted activations. Again isolate a two-position window as four singleton cards, at cost at most . Require that the two packets have the same number of prefix blocks, and also the same number of suffix blocks. Prefix and suffix partitions are independent. For a binomial variable of variance and an independent copy , concentration in an interval of at most integers gives
Indeed, Chebyshev at radius leaves probability at least , and Cauchy–Schwarz gives the displayed bound. Prefix and suffix block counts are shifted binomials or deterministic zeros. Their two agreements therefore have joint probability at least .
On agreement, let each packet have prefix blocks and suffix blocks, and put . Under uniform block interleaving the chance of reaching the two window heads together is
For example, this inequality follows from , including . Each of the two four-card patterns used above has conditional probability at least , now with block counts replacing card counts. Their probabilities are equal, so their union is already a fair swap. Multiplying the estimates gives activation probability at least . One-position windows similarly give the matching with at least this probability. Within a layer, condition on the partitions and the exterior interleaving. All allowed orientations then have equal weight, which verifies Lemma 9.1.
Markov-label activations. Put and . Partition the neighboring input edges into three layers according to modulo three. Pairs in one layer have at least one intervening fixed label, and are conditionally independent given the exterior labels. For an interior pair, require its two exterior labels to agree and its two interior labels to differ. Exchanging the interior labels has equal conditional weight and swaps exactly the two adjacent input cards in the inverse shuffle. The total activation probability is : the four relevant length-four patterns each have probability .
For a pair touching an endpoint, common-part extraction conditional on its single exterior neighbor has activation probability , also at least . Apply Lemma 9.1 and then Lemma 9.2 with . This proves (32). The adjacent-mark collision mechanism is related to that used in the stronger fixed-parameter analysis of [13]; the present argument is a direct parameter-explicit spectral comparison, not an improvement on their dependence.
A sharper high-adhesion bound for the cut-first models
The local bounds lose unnecessary powers of when almost every contact survives. A different argument uses the frequent rotations and the rare one-break moves. Unlike the balanced-cut proof, it works for odd decks too.
Theorem 10.1 (Rotation and one-break comparison). For let and define
Then and . For each of , , , with , put
An explicit common upper bound is
In particular (4) holds with an absolute constant.
Proof. Write for a cyclic rotation and for its invariant-space projection. The all-surviving-bonds event shows that the increment law at contains times its law at . Empty cuts can be split with this same weight, so the assertion is unconditional.
For and the rotation operator is , with . For it is the same expression with : indeed . At any nontrivial th root of unity the binomial multiplier has modulus at most . The inequalities
imply a squared-norm deficit at least away from . Mixture variance therefore gives
Now let , the output-list permutation that moves card to the bottom. At cut , use left blocks , and one whole right block. This requires one broken bond and surviving bonds, of probability . The order left-large, right, left-singleton produces . Its conditional probability is one for interpolation, for block-weighted release, and for card-weighted release. Thus every family gives mass at least , for .
Allocate half of each such atom to each neighboring pair of indices, discarding unused endpoint allocations. For the pair , the conditional variance contributes at least
because . Summing disjoint allocations gives
Here and .
On a central eigenspace , put and , . Cyclic invariance makes all cyclic neighboring-edge energies of equal. The path comparison consequently yields
Since each is a contraction and , it follows that . Equations (34) and (35) give . The central spectral sum proves (33).
Finally, on , the adjacent binomial-mass ratios tend uniformly to one and . This interval has binomial probability tending to one. Outside it the total mass tends to zero. Thus ; its finite values for are positive. This proves the absolute-constant order bound.
Proof of Theorem 2.5. For fixed , (33) is as , while (20) gives the matching lower bound. For , combine (32) with (21). The numerator is positive in the stated range.
Remark 10.2 (Why one parameter has two different singular exponents). In a cut-first model, the imposed cut already creates two packets. One additional broken contact can produce a move outside the rotation subgroup. In the inverse-label model, zero or one label switch still gives only a rotation. At least two switches are necessary. This is a structural distinction in the models, not evidence for a universal physical exponent. For the rotation subgroup is all of , so the quadratic-exponent statement is deliberately not made.
Small adhesion, regeneration, and a cutoff regime
Proposition 11.1 (A comparison that is valid without commutation). For even , let . For ,
Proof. With probability all internal bonds at a nonempty cut break. Splitting empty-cut identity mass by the same factor yields for a contraction . Mixture variance gives . Apply the central comparison of Lemma 7.4 and its full spectral proof. No claim that arbitrary intervening shuffles commute or can only accelerate mixing is used.
Proposition 11.2 (A GSR regeneration-window bound). Let , and put , , and . For and ,
Proof. One round contains times its kernel, which is GSR or inverse GSR. A run of such components therefore has weight in the -step kernel. After inverse GSR shuffles, independent uniform -bit labels have all distinct values with probability . Conditional on this event their order is uniform, so the -step GSR kernel minorizes . This standard strong-stationary construction is described in [2, 5]. Consequently each -step window has a uniform component of mass at least . All residual kernels preserve uniform measure. Iterating the minorization gives (36). This argument uses whole windows, not invalid thinning of isolated successful rounds.
In particular, for any fixed , if then stays bounded as . The regeneration bound and the information floor give for all three GSR-derived families. The next result strengthens this order statement to the classical cutoff location under a little- assumption.
Theorem 11.3 (Classical cutoff survives sufficiently weak adhesion). For and all integers ,
In particular, if , these families have the GSR cutoff at , with an window. On time sequences where the classical profile converges, their profiles have the same limit.
Proof. Couple each round with its version until the first surviving bond. At most contacts are tested in a round, and, conditional on no surviving bond, the interleaving or labeling is precisely the original GSR rule. A union bound over the tested contacts and rounds gives (37). The error is throughout any time range under the hypothesis. Transfer the classical total-variation cutoff and profile from [5]; inversion does not change the Markov family’s distance. This does not prove cutoff for fixed .
| Regime | What is proved | What is not proved |
| GSR cutoff; slow interpolation lower bound | Interpolation’s sharp order or cutoff | |
| Logarithmic order for C, B, M; GSR cutoff under little- | A fixed-positive- cutoff theorem | |
| Fixed | Polynomial cut-first bounds; for M | Matching orders for the cut-first families |
| Improved cut-first upper bound; inverse-model quadratic obstruction | Sharp powers of | |
| Fixed , | Exact linear versus quadratic parameter exponents | A large-deck cutoff conclusion |
Table 3. Different limits answer different questions. A fixed- adhesion exponent is not a substitute for a uniform-in- mixing theorem.
Finite calculations and reproducibility
Table 4 evaluates the exact binomial sums in the entropy formula. The entropy time is not an estimate proved to equal the mixing time, especially for small .
| lower bound at | |||||
| 52 | 3.8973 | 3.6462 | 7.5434 | 29.9043 | 23 |
| 64 | 4.0471 | 4.8910 | 8.9381 | 33.1161 | 25 |
| 256 | 5.0471 | 8.5872 | 13.6343 | 123.5117 | 93 |
| 1024 | 6.0471 | 15.4730 | 21.5201 | 407.4797 | 306 |
| 16384 | 8.0471 | 54.7737 | 62.8208 | 3275.1458 | 2457 |
Table 4. Entropy quantities in bits and rounds. The last column is the ceiling of Proposition 5.2 with , not an observed mixing time.
The baseline script verify_shuffle.py performs the following diagnostics, recorded in verification_results.json:
Exact rational midpoint enumeration checks the tie formula for 8,382 deck-size/cut pairs with .
For each of the 63 even sizes from 4 through 128, it checks the Hamiltonian-cycle identity, the containment of the nearby-cut tie in , and the noncentral-divisor bound.
It enumerates the full transition matrices on and , checks double stochasticity, and checks the two quadratic-form inequalities numerically. The minimum eigenvalues are nonnegative up to floating-point errors below .
Direct matrix iteration gives for and for .
These small cases can detect convention or implementation errors. They provide no empirical evidence for an asymptotic cutoff and are not used as premises in the proofs.
The combinatorial and entropy checks require only the Python standard library. The optional full-matrix checks require NumPy. They can be run as
python3 verify_shuffle.py --max-n 128 --matrix \
--output verification_results.json
No Monte Carlo estimate, training procedure, or fitted asymptotic exponent is used in this manuscript.
For the four families, the extension script verify_adhesive_shuffles.py additionally checks:
140 exact rational increment laws: all four families, , and . These checks include normalization, the block versus updated-count descriptions of , the two descriptions of , the original interpolation law at , and endpoint supports.
The conditional binomial block-count law and the interpolation entropy bound on the same grid; the insertion identity and cyclic Fourier inequality through .
All three local-layer quadratic-form inequalities for every family at , , , and ; and both rotation/insertion inequalities for the three cut-first families at these points and at and .
Direct full-state iteration for Table 5, including the distances immediately before and at each reported threshold. Every displayed comparison includes all four completed arms; no partial or timed-out arm is silently omitted.
| 4 | 0 | 3 | 3 | 3 | 3 |
| 4 | 4 | 4 | 2 | 7 | |
| 4 | 19 | 18 | 6 | 143 | |
| 6 | 0 | 3 | 3 | 4 | 3 |
| 6 | 6 | 6 | 3 | 8 | |
| 6 | 25 | 24 | 10 | 132 |
Table 5. Numerically computed in full-shuffle units, starting from the identity. These are small-deck diagnostics, not asymptotic evidence. In particular, interpolation need not slow monotonically as adhesion increases: breaking the perfectly regular schedule can initially help. This observation is not a physical calibration.
Results are recorded in adhesive_verification_results.json. The transition probabilities are enumerated exactly before conversion to floating point for matrix operations. Numerical positive-semidefiniteness checks use tolerance and do not certify the symbolic inequalities. Run the extended checks with:
python3 verify_adhesive_shuffles.py --max-n 8 --matrix \
--output adhesive_verification_results.json
Cutoff, limitations, and directions for improvement
What remains unresolved
A family has total-variation cutoff at times if, for each fixed , the distances at and tend respectively to one and zero. Theorem 11.3 proves cutoff for the GSR-derived families under a vanishing-adhesion hypothesis. It does not extend to a fixed positive adhesion parameter, nor to the interpolation family.
For unglued interpolation, Theorem 3.4 proves the first limit with , but not the second. For every fixed , they imply
Thus the current lower and upper scales differ by a factor of order . We do not know from these arguments whether the true scale is , a larger polynomial scale, or something between them. Likewise, the fixed-positive- cut-first bounds do not match in . The sharp parameter exponents in Theorem 2.5 hold with fixed, and cannot settle these large-deck questions.
Sufficient input entropy is not sufficient mixing. GSR shuffling is a useful warning: its input-entropy lower scale is , while its actual total-variation cutoff is [5]. The word “entropic” in this manuscript labels a lower-bound clock, not a proved location of cutoff.
Where the upper argument loses information
The unglued proof deliberately uses only two cuts. Their probabilities are , and the induced comparison graph is only a cycle. All other cuts are discarded through a contraction inequality. This robust simplification is responsible for much of the potential loss. It also replaces nonreversible deterministic transport by a norm comparison, which may conceal accelerated spreading over several rounds.
Three concrete improvements suggest themselves. First, use a window of typical cuts rather than two individual cuts, and analyze the resulting collection of conjugated matchings. Second, study a multistep operator in a frame following the deterministic merges; expansion of these matchings might give stronger contraction than a one-step comparison. Third, adapt the collision-based entropy approach of Morris [19] directly to the cut-dependent matchings. None of these steps is supplied by the present proof.
For the adhesive cut-first models, the local argument uses just the balanced cut and very conservative probabilities of meeting in selected singleton windows. The high-adhesion argument instead retains rotations and one-break insertions. Taking the better estimate reduces parameter losses, but neither comparison is expected to capture all of the transport created by typical shuffles. For , the literature’s result already improves our elementary dependence when is fixed; our contribution there is explicit endpoint control.
Other deck sizes and other noise scales
For odd , unglued interpolation has no midpoint ties. The rule then has only the cut randomness, and elementary support counting already gives an order- lower bound at fixed error. The sharper even-deck analysis is driven by an event, the exactly balanced cut, that does not exist for odd decks. No upper theorem for odd-deck is claimed here. In contrast, Theorem 10.1 covers all three cut-first models on odd decks when , and the Markov-label bound works on either parity.
Continuous perturbations smaller than all define the same chain. Perturbations large enough to reverse strict cross-packet comparisons can inject additional randomness. One must then specify the noise law, its scaling, and whether within-packet order is enforced. A single common phase per packet is different again: at an equal cut, its choices are globally correlated rather than independent for each pair. These variants should not be conflated in a cutoff claim.
Conclusion
One independently resampled contact-survival probability yields several distinct, mathematically transparent shuffles. Card-weighted selection must update remaining card counts after every drop; block-weighted selection, midpoint scheduling, and correlated-label inversion are different rules, not equivalent implementations.
The paper establishes explicit parameter-dependent upper and lower bounds, an interpolation information obstruction, and exact fixed-deck adhesion exponents: linear for cut-first release and quadratic for correlated labels. Classical cutoff transfers in a sufficiently weak perturbation regime. Sharp large-deck mixing orders and cutoff for the new fixed-parameter cut-first families remain open within this analysis. The contact model is physically motivated, but is neither a force law nor an experimentally validated model of hand shuffling.
References
- [1]D. Aharonov, I. Arad, Z. Landau, and U. Vazirani. The Detectability Lemma and Quantum Gap Amplification. Preprint, 2008. https://arxiv.org/abs/0811.3412.
- [2]D. Aldous and P. Diaconis. Shuffling cards and stopping times. American Mathematical Monthly 93 (1986), 333–348.DOI
- [3]H. Alarcón, T. Salez, C. Poulard, J.-F. Bloch, É. Raphaël, K. Dalnoki-Veress, and F. Restagno. Self-amplification of solid friction in interleaved assemblies. Physical Review Letters 116 (2016), 015502. https://doi.org/10.1103/PhysRevLett.116.015502.
- [4]A. Anshu, I. Arad, and T. Vidick. Simple proof of the detectability lemma and spectral gap amplification. Physical Review B 93 (2016), 205142. https://doi.org/10.1103/PhysRevB.93.205142.
- [5]D. Bayer and P. Diaconis. Trailing the dovetail shuffle to its lair. Annals of Applied Probability 2 (1992), 294–313. https://doi.org/10.1214/aoap/1177005705.
- [6]T. A. L. Burgo, C. A. Silva, L. B. S. Balestrin, and F. Galembeck. Friction coefficient dependence on electrostatic tribocharging. Scientific Reports 3 (2013), 2384. https://doi.org/10.1038/srep02384.
- [7]P. Diaconis and J. Fulman. The Mathematics of Shuffling Cards. American Mathematical Society, 2023. https://www.ams.org/books/mbk/146/.DOI
- [8]P. Diaconis. The cutoff phenomenon in finite Markov chains. Proceedings of the National Academy of Sciences USA 93 (1996), 1659–1664. https://doi.org/10.1073/pnas.93.4.1659.
- [9]P. Diaconis, R. L. Graham, and W. M. Kantor. The mathematics of perfect shuffles. Advances in Applied Mathematics 4 (1983), 175–196. https://darkwing.uoregon.edu/~kantor/PAPERS/PerfectShuffles.pdf.DOI
- [10]P. Diaconis and L. Saloff-Coste. Comparison techniques for random walk on finite groups. Annals of Probability 21 (1993), 2131–2156. https://pi.math.cornell.edu/~lsc/papers/comp-fig.pdf.DOI
- [11]P. Diaconis and M. Shahshahani. Generating a random permutation with random transpositions. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 57 (1981), 159–179. https://doi.org/10.1007/BF00535487.
- [12]Y. Jiang. A subquadratic upper bound for the mixing time of the Thorp shuffle. Preprint, submitted October 3, 2026. https://arxiv.org/abs/2610.18884.
- [13]J. Jonasson and B. Morris. Rapid mixing of dealer shuffles and clumpy shuffles. Electronic Communications in Probability 20 (2015), no. 20, 1–11. https://doi.org/10.1214/ECP.v20-3862.
- [14]J. Jonasson. The overhand shuffle mixes in Θ(n² log n) steps. Annals of Applied Probability 16 (2006), 231–243. https://doi.org/10.1214/1050516050000000692.
- [15]H. Lacoin. Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion. Annals of Probability 44 (2016), 1426–1487. https://arxiv.org/abs/1309.3873.
- [16]S. P. Lalley. Riffle shuffles and their associated dynamical systems. Journal of Theoretical Probability 12 (1999), 903–932. https://doi.org/10.1023/A:1021636902356.
- [17]D. A. Levin and Y. Peres, with contributions by E. L. Wilmer. Markov Chains and Mixing Times, second edition. American Mathematical Society, 2017. https://pages.uoregon.edu/dlevin/MARKOV/markovmixing.pdf.
- [18]B. Morris. The mixing time of the Thorp shuffle. SIAM Journal on Computing 38 (2008), 484–504. https://doi.org/10.1137/050636231.
- [19]B. Morris. Improved mixing time bounds for the Thorp shuffle and L-reversal chain. Annals of Probability 37 (2009), 453–477. https://doi.org/10.1214/08-AOP409.
- [20]B. Morris. Improved mixing time bounds for the Thorp shuffle. Combinatorics, Probability and Computing 22 (2013), 118–132. https://doi.org/10.1017/S0963548312000478.
- [21]M. Palomares. Comparing the Mixing Rates of Neat Riffle Shuffles. University of Michigan REU report, August 2025; mentor M. Conger. https://lsa.umich.edu/content/dam/math-assets/reu-su22/2025/REU_Report_Final_Mateo_Palomares.pdf.
- [22]R. Pemantle. Randomization time for the overhand shuffle. Journal of Theoretical Probability 2 (1989), 37–49. https://doi.org/10.1007/BF01048267.
- [23]B. N. J. Persson, M. Scaraggi, and A. I. Volokitin. Contact electrification and the work of adhesion. Preprint, 2013. https://arxiv.org/abs/1305.2709.
- [24]M. Sellke, J. Shi, and J. Wang. Universality of Cutoff for Riffle Shuffling. Preprint, 2025. https://arxiv.org/abs/2510.22783.
- [25]E. O. Thorp. Nonrandom shuffling with applications to the game of faro. Journal of the American Statistical Association 68 (1973), 842–847. https://doi.org/10.1080/01621459.1973.10481434.
- [26]D. B. Wilson. Mixing times of lozenge tiling and card shuffling Markov chains. Annals of Applied Probability 14 (2004), 274–325.DOI