SearcharxivSearch

arXiv · 2506.18673

Asymptotic Expansions of Gaussian and Laguerre Ensembles at the Soft Edge III: Generating Functions

Abstract

We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the correction terms in the asymptotic expansion are multilinear forms of the higher-order derivatives of the leading-order term, with certain rational polynomial coefficients that are independent of the dummy generating function variable. In this way, the same multilinear structure, with the same polynomial coefficients, is inherited by the asymptotic expansion of any linearly induced quantity such as the distribution of the $k$-th largest level. Whereas the results for the unitary ensembles are presented with proof, the discussion of the orthogonal and symplectic ones is based on some hypotheses. To substantiate the hypotheses, we check the result for the $k$-th largest level in the orthogonal ensembles against simulation data for choices of $n$ and $k$ that require as many as four correction terms to achieve satisfactory accuracy.

Explore related subjects

Keep this discovery

BibTeXRIS

Folkmar Bornemann. 2025-06-23. Asymptotic Expansions of Gaussian and Laguerre Ensembles at the Soft Edge III: Generating Functions. https://doi.org/10.3842/sigma.2026.047

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