SearcharxivSearch

arXiv · math/0607635

Central limit theorem for random partitions under the Plancherel measure

Abstract

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that, under the suitable normalization (growing as the square root of log n), the corresponding random process converges, in the sense of finite dimensional distributions, to a Gaussian process with independent values. The proof uses heavily the determinantal structure of the correlation functions and is based on the application of the Costin-Lebowitz-Soshnikov central limit theorem. At the spectrum edges, the fluctuation asymptotics is expressed in terms of the largest members of the Airy ensemble; in particular, at the upper edge the limit distribution appears to be discrete (without any normalization). These results admit an elegant symmetric reformulation under the rotation of Young diagrams by 45 degrees, where the normalization no longer depends on the location of the spectrum point. We also discuss the link of our central limit theorem with an earlier result by S.V. Kerov on the convergence to a generalized Gaussian process.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. V. Bogachev, Z. G. Su. 2006-07-25. Central limit theorem for random partitions under the Plancherel measure. https://arxiv.org/abs/math/0607635

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