SearcharxivSearch

arXiv · 2402.04827

The scaling limit of the volume of loop O(n) quadrangulations

Abstract

We study the volume of rigid loop-$O(n)$ quadrangulations with a boundary of length $2p$ in the non-generic critical regime. We prove that, as the half-perimeter $p$ goes to infinity, the volume scales in distribution to an explicit random variable. This limiting random variable is described in terms of the multiplicative cascades of Chen, Curien and Maillard arXiv:1702.06916, or alternatively (in the dilute case) as the law of the area of a unit-boundary $\gamma$-quantum disc, as determined by Ang and Gwynne arXiv:1903.09120, for suitable $\gamma$. Our arguments go through a classification of the map into several regions, where we rule out the contribution of bad regions to be left with a tractable portion of the map. One key observable for this classification is a Markov chain which explores the nested loops around a size-biased vertex pick in the map, making explicit the spinal structure of the discrete multiplicative cascade. We stress that our techniques enable us to include the boundary case $n=2$, that we define rigorously, and where the nested cascade structure is that of a critical branching random walk. In that case the scaling limit is given by the limit of the derivative martingale and is inverse-exponentially distributed, which answers a conjecture of arXiv:2005.06372v2.

Explore related subjects

Keep this discovery

BibTeXRIS

Élie Aïdékon, William Da Silva, Xingjian Hu. 2024-02-07. The scaling limit of the volume of loop O(n) quadrangulations. https://arxiv.org/abs/2402.04827

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