SearcharxivSearch

arXiv · 2511.01058

Limit profiles and cutoff for the Burnside process on Sylow double cosets

Abstract

This article gives sharp estimates for the mixing time of the Burnside process for Sylow $p$-double cosets in the symmetric group $S_n$. This process is a Markov chain on $S_n$ which can be used to uniformly sample Sylow $p$-double cosets. The analysis applies when $n = pk$ with $p$ prime and $k < p$. The main result describes the limit profile of the distance to the stationary distribution as $p$ goes to infinity. From the limit profile, we get the following two corollaries. First, if $k$ remains fixed as $p \to \infty$, then order $p$ steps are necessary and sufficient for mixing and cut-off does not occur. Second, if $k \to \infty$ as $p \to \infty$, then cut-off occurs at $p \log k$ with a window of size $p$. The limit profile is derived from explicit upper and lower bounds on the distance between the Burnside process and its stationary distribution. These non-asymptotic bounds give very accurate approximations even for $p$ as small as 11.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Howes. 2025-11-02. Limit profiles and cutoff for the Burnside process on Sylow double cosets. https://arxiv.org/abs/2511.01058

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