Abstract

We investigate the structure of large uniform random maps with nn edges, fn\mathrm{f}_n faces, and with genus gn\mathrm{g}_n in the so-called sparse case, where the ratio between the number vertices and edges tends to 11. We focus on two regimes: the planar case (fn,2gn)=(sn,0)(\mathrm{f}_n, 2\mathrm{g}_n) = (\mathrm{s}_n, 0) and the unicellular case with moderate genus (fn,2gn)=(1,sn−1)(\mathrm{f}_n, 2 \mathrm{g}_n) = (1, \mathrm{s}_n-1), both when 1≪sn≪n1 \ll \mathrm{s}_n \ll n. Albeit different at first sight, these two models can be treated in a unified way using a probabilistic version of the classical core-kernel decomposition. In particular, we show that the number of edges of the core of such maps, obtained by iteratively removing degree 11 vertices, is concentrated around nsn\sqrt{n \mathrm{s}_{n}}. Further, their kernel, obtained by contracting the vertices of the core with degree 22, is such that the sum of the degree of its vertices exceeds that of a trivalent map by a term of order sn3/n\sqrt{\mathrm{s}_{n}^{3}/n}; in particular they are trivalent with high probability when sn≪n1/3\mathrm{s}_{n} \ll n^{1/3}. This enables us to identify a mesoscopic scale n/sn\sqrt{n/\mathrm{s}_n} at which the scaling limits of these random maps can be seen as the local limit of their kernels, which is the dual of the UIPT in the planar case and the infinite three-regular tree in the unicellular case, where each edge is replaced by an independent (biased) Brownian tree with two marked points.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.