SearcharxivSearch

arXiv · 2603.27433

The $k$-cycle shuffling with repeated cards

Abstract

We investigate the $k$-cycle shuffle on repeated cards, namely on a deck consisting of $l$ identical copies of each of $m$ card types, with total size $n=ml$. We establish asymptotic results for the total variation mixing of this shuffle, including cutoff and explicit limiting profiles. For fixed $l$, we show that the walk exhibits cutoff at time $\frac{n}{k}\log n$ with window of order $\frac{n}{k}$, and we identify the limiting profile in terms of the total variation distance between Poisson distributions arising from quotient fixed-point statistics. When $l\to\infty$ with sufficiently slow growth, more precisely when $l=o(\log n)$, we prove that the cutoff location shifts to $\frac{n}{k}\left(\log n-\frac 12\log l\right)$, again with window of order $\frac{n}{k}$, and that the limiting profile is asymptotically Gaussian, arising from a Poisson comparison after normal approximation. The proof is based on an approximation of the shuffling measure by an explicitly tractable auxiliary measure, generalizing the $k=2$ case from Jain and Sawhney (arXiv:2410.23944). The representation-theoretic framework underlying the analysis of this auxiliary measure follows from the work of Hough (arXiv:1605.00911) and Nestoridi and Olesker-Taylor (arXiv:2005.13437)

Explore related subjects

Keep this discovery

BibTeXRIS

Jiahe Shen. 2026-03-28. The $k$-cycle shuffling with repeated cards. https://arxiv.org/abs/2603.27433

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR