SearcharxivSearch

arXiv · 1508.00133

Geometry of the Uniform Infinite Half-Planar Quadrangulation

Abstract

We give a new construction of the uniform infinite half-planar quadrangulation with a general boundary (or UIHPQ), analogous to the construction of the UIPQ presented by Chassaing and Durhuus, which allows us to perform a detailed study of its geometry. We show that the process of distances to the root vertex read along the boundary contour of the UIHPQ evolves as a particularly simple Markov chain and converges to a pair of independent Bessel processes of dimension $5$ in the scaling limit. We study the "pencil" of infinite geodesics issued from the root vertex as Ménard, Miermont and the second author did for the UIPQ, and prove that it induces a decomposition of the UIHPQ into three independent submaps. We are also able to prove that balls of large radius around the root are on average $7/9$ times as large as those in the UIPQ, both in the UIHPQ and in the UIHPQ with a simple boundary; this fact we use in a companion paper to study self-avoiding walks on large quadrangulations.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandra Caraceni, Nicolas Curien. 2015-08-01. Geometry of the Uniform Infinite Half-Planar Quadrangulation. https://arxiv.org/abs/1508.00133

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