SearcharxivSearch

arXiv · 2212.12511

Compact Brownian surfaces II. Orientable surfaces

Abstract

Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this quadrangulation with the usual graph metric renormalized by $n^{-1/4}$, mark it on each boundary component, and endow it with the counting measure on its vertex set renormalized by $n^{-1}$, as well as the counting measure on each boundary component renormalized by $n^{-1/2}$. We show that, as $n\to\infty$, this random marked measured metric space converges in distribution for the Gromov--Hausdorff--Prokhorov topology, toward a random limiting marked measured metric space called a Brownian surface. This extends known convergence results of uniform random planar quadrangulations with at most one boundary component toward the Brownian sphere and toward the Brownian disk, by considering the case of quadrangulations on general compact orientable surfaces. Our approach consists in cutting a Brownian surface into elementary pieces that are naturally related to the Brownian sphere and the Brownian disk and their noncompact analogs, the Brownian plane and the Brownian half-plane, and to prove convergence results for these elementary pieces, which are of independent interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Jérémie Bettinelli, Grégory Miermont. 2022-12-23. Compact Brownian surfaces II. Orientable surfaces. https://arxiv.org/abs/2212.12511

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