SearcharxivSearch

arXiv · 1807.07511

Harmonic functions on mated-CRT maps

Abstract

A mated-CRT map is a random planar map obtained as a discretized mating of correlated continuum random trees. Mated-CRT maps provide a coarse-grained approximation of many other natural random planar map models (e.g., uniform triangulations and spanning tree-weighted maps), and are closely related to $\gamma$-Liouville quantum gravity (LQG) for $\gamma \in (0,2)$ if we take the correlation to be $-\cos(\pi\gamma^2/4)$. We prove estimates for the Dirichlet energy and the modulus of continuity of a large class of discrete harmonic functions on mated-CRT maps, which provide a general toolbox for the study of the quantitative properties random walk and discrete conformal embeddings for these maps. For example, our results give an independent proof that the simple random walk on the mated-CRT map is recurrent, and a polynomial upper bound for the maximum length of the edges of the mated-CRT map under a version of the Tutte embedding. Our results are also used in other work by the first two authors which shows that for a class of random planar maps --- including mated-CRT maps and the UIPT --- the spectral dimension is two (i.e., the return probability of the simple random walk to its starting point after $n$ steps is $n^{-1+o_n(1)}$) and the typical exit time of the walk from a graph-distance ball is bounded below by the volume of the ball, up to a polylogarithmic factor.

Explore related subjects

Keep this discovery

BibTeXRIS

Ewain Gwynne, Jason Miller, Scott Sheffield. 2018-07-19. Harmonic functions on mated-CRT maps. https://arxiv.org/abs/1807.07511

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