SearcharxivSearch

arXiv · 2305.03723

Uniform convergence of Dyson Ferrari--Spohn diffusions to the Airy line ensemble

Abstract

We consider the Dyson Ferrari--Spohn diffusion $\mathcal{X}^N = (\mathcal{X}^N_1,\dots,\mathcal{X}^N_N)$, consisting of $N$ non-intersecting Ferrari--Spohn diffusions $\mathcal{X}^N_1 > \cdots > \mathcal{X}^N_N > 0$ on $\mathbb{R}$. This object was introduced by Ioffe, Velenik, and Wachtel (2018) as a scaling limit for line ensembles of $N$ non-intersecting random walks above a hard wall with area tilts, which model certain three-dimensional interfaces in statistical physics. It was shown by Ferrari and Shlosman (2023) that as $N\to\infty$, after a spatial shift of order $N^{2/3}$ and constant rescaling in time, the top curve $\mathcal{X}^N_1$ converges to the $\mathrm{Airy}_2$ process in the sense of finite-dimensional distributions. We extend this result by showing that the full ensemble $\mathcal{X}^N$ converges with the same shift and time scaling to the Airy line ensemble in the topology of uniform convergence on compact sets. In our argument we formulate a Brownian Gibbs property with area tilts for $\mathcal{X}^N$, which we show is equivalent after a global parabolic shift to the usual Brownian Gibbs property introduced by Corwin and Hammond (2014).

Explore related subjects

Keep this discovery

BibTeXRIS

Evgeni Dimitrov, Christian Serio. 2023-05-05. Uniform convergence of Dyson Ferrari--Spohn diffusions to the Airy line ensemble. https://arxiv.org/abs/2305.03723

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