SearcharxivSearch

arXiv · 1510.06346

Scaling limits for the critical Fortuin-Kastelyn model on a random planar map III: finite volume case

Abstract

We prove scaling limit results for the finite-volume version of the inventory accumulation model of Sheffield (2011), which encodes a random planar map decorated by a collection of loops sampled from the critical Fortuin-Kasteleyn (FK) model. In particular, we prove that the random walk associated with the finite-volume version of this model converges in the scaling limit to a correlated Brownian motion $\dot Z$ conditioned to stay in the first quadrant for two units of time and satisfy $\dot Z(2) = 0$. We also show that the times which describe complementary connected components of FK loops in the discrete model converge to the $\pi/2$-cone times of $\dot Z$. Combined with recent results of Duplantier, Miller, and Sheffield, our results imply that many interesting functionals of the FK loops on a finite-volume FK planar map (e.g. their boundary lengths and areas) converge in the scaling limit to the corresponding "quantum" functionals of the CLE$_\kappa$ loops on a $4/\sqrt\kappa$-Liouville quantum gravity sphere for $\kappa \in (4,8)$. Our results are finite-volume analogues of the scaling limit theorems for the infinite-volume version of the inventory accumulation model proven by Sheffield (2011) and Gwynne, Mao, and Sun (2015).

Explore related subjects

Keep this discovery

BibTeXRIS

Ewain Gwynne, Xin Sun. 2015-10-21. Scaling limits for the critical Fortuin-Kastelyn model on a random planar map III: finite volume case. https://arxiv.org/abs/1510.06346

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