SearcharxivSearch

arXiv · 2603.05491

Local limits of uniform triangulations with boundaries in high genus

Abstract

We study the local limits of uniform random triangulations with boundaries in the regime where the genus is proportional to the number of faces. Budzinski and Louf proved in 2020 that when there are no boundaries, the local limits exist and are the Planar Stochastic Hyperbolic Triangulation (PSHT) introduced in PSHT. We show that when the triangulations considered have size n and boundaries with total length p that tends to infinity with n and p=o(n), the local limits around a typical boundary edge are the half-plane hyperbolic triangulations defined by Angel and Ray. This provides, for the first time, a construction of these hyperbolic half-plane triangulations as local limits of large genus triangulations. We also prove that under the condition p = o(n), the local limit when rooted on a uniformly chosen oriented edge is given by the PSHT. Contrary to the proof of Budzinski and Louf, the latter does not rely on the Goulden-Jackson recurrence relation, but only on coarse combinatorial estimates. Thus, we expect that the proof can be adapted to local limits in similar models.

Explore related subjects

Keep this discovery

BibTeXRIS

Tanguy Lions. 2026-03-05. Local limits of uniform triangulations with boundaries in high genus. https://arxiv.org/abs/2603.05491

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