SearcharxivSearch

arXiv · 2411.10829

Airy$_\beta$ line ensemble and its Laplace transform

Abstract

The Airy$_\beta$ line ensemble is a random collection of continuous curves, which should serve as a universal edge scaling limit in problems related to eigenvalues of random matrices and models of 2d statistical mechanics. This line ensemble unifies many existing universal objects including Tracy-Widom distributions, eigenvalues of the Stochastic Airy Operator, Airy$_2$ process from the KPZ theory. Here $\beta>0$ is a real parameter governing the strength of the repulsion between the curves. We introduce and characterize the Airy$_\beta$ line ensemble in terms of the Laplace transform, by producing integral formulas for its joint multi-time moments. We prove two asymptotic theorems for each $\beta>0$: the trajectories of the largest eigenvalues in the Dyson Brownian Motion converge to the Airy$_\beta$ line ensemble; the extreme particles in the G$\beta$E corners process converge to the same limit. The proofs are based on the convergence of random walk expansions for the multi-time moments of prelimit objects towards their Brownian counterparts. The expansions are produced through Dunkl differential-difference operators acting on multivariate Bessel generating functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vadim Gorin, Jiaming Xu, Lingfu Zhang. 2024-11-16. Airy$_\beta$ line ensemble and its Laplace transform. https://arxiv.org/abs/2411.10829

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