Extends shelf shuffle analysis from p=1/2 to general p, deriving distributions for cycles, descents, inversions, valleys and RSK shapes.
Limit theorems for descents and inversions of shelf-shuffles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We prove central limit theorems for the number of descents and inversions of permutations produced by shelf-shuffles. These are a model for casino card shuffling machines. We show the asymptotic normality of the number of descents in two limiting regimes depending on the ratio of cards to shelves. On the other hand, we study the inversions by employing a modification of the techniques from Islak's analysis of the statistics of riffle shuffles. In particular, we obtain a bound for the rate of convergence for inversions that is independent of the number of shelves.
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Analysis of the asymmetric shelf shuffle
Extends shelf shuffle analysis from p=1/2 to general p, deriving distributions for cycles, descents, inversions, valleys and RSK shapes.