SearcharxivSearch

arXiv · 2010.13939

Near-maxima of the two-dimensional Discrete Gaussian Free Field

Abstract

We consider the Discrete Gaussian Free Field (DGFF) in domains $D_N\subseteq\mathbb Z^2$ arising, via scaling by $N$, from nice domains $D\subseteq\mathbb R^2$. We study the statistics of the values order $\sqrt{\log N}$ below the absolute maximum. Encoded as a point process on $D\times\mathbb R$, the scaled spatial distribution of these near-extremal level sets in $D_N$ and the field values (in units of $\sqrt{\log N}$ below the absolute maximum) tends, as $N\to\infty$, in law to the product of the critical Liouville Quantum Gravity (cLQG) $Z^D$ and the Rayleigh law. The convergence holds jointly with the extremal process, for which $Z^D$ enters as the intensity measure of the limiting Poisson point process, and that of the DGFF itself; the cLQG defined by the limit field then coincides with $Z^D$. While the limit near-extremal process is measurable with respect to the limit continuum GFF, the limit extremal process is not. Our results explain why the various ways to "norm" the lattice cLQG measure lead to the same limit object, modulo overall normalization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marek Biskup, Stephan Gufler, Oren Louidor. 2020-10-26. Near-maxima of the two-dimensional Discrete Gaussian Free Field. https://doi.org/10.1214/23-aihp1418

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