On breadth-first constructions of scaling limits of random graphs and random unicellular maps

Grégory Miermont, Sanchayan Sen

备注：: 39 pages, 7 figures; to appear in Random Structures & Algorithms

英文摘要：

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum random tree and make `horizontal' point identifications, at random heights, using the local time measures. Consequently, this can be seen as a continuum analogue of the breadth-first construction of a finite connected graph. In particular, this yields a breadth-first construction of the scaling limit of the critical Erdős-Rényi random graph which answers a question posed in [2]. As a consequence of this breadth-first construction we obtain descriptions of the radii, the distance profiles, and the two point functions of these spaces in terms of functionals of tilted Brownian excursions.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees

A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the case of labelled unicellular maps, which are related to all rooted maps by Marcus and Schaeffer's bijection. This gives an immediate derivation of the asymptotic number of unicellular maps of given genus, and a simple bijective proof of a formula of Lehman and Walsh on the number of triangulations with one vertex. From the labelled case, we deduce an expressio…

2009-03-05math.COmath.PR

The local limit of unicellular maps in high genus

We show that the local limit of unicellular maps whose genus is proportional to the number of edges is a supercritical geometric Galton-Watson tree conditioned to survive. The proof relies on enumeration results obtained via the recent bijection given by the second author together with Feray and Fusy.

2013-09-24math.COmath.PR

Short cycles in high genus unicellular maps

We study large uniform random maps with one face whose genus grows linearly with the number of edges, which are a model of discrete hyperbolic geometry. In previous works, several hyperbolic geometric features have been investigated. In the present work, we study the number of short cycles in a uniform unicellular map of high genus, and we show that it converges to a Poisson distribution. As a corollary, we obtain the law of the systole of uniform unicellular maps in high genus. We also obtain the asymptotic distribution of the vertex degrees in such a map.

2021-03-03math.COmath.PR

Large expanders in high genus unicellular maps

We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been discovered, such as their local limit or their logarithmic diameter. In this work, we show that with high probability such a map contains a very large induced subgraph that is an expander.

2021-02-25math.COmath.PR

Large Unicellular maps in high genus

We study the geometry of a random unicellular map which is uniformly distributed on the set of all unicellular maps whose genus size is proportional to the number of edges of the map. We prove that the distance between two uniformly selected vertices of such a map is of order $\log n$ and the diameter is also of order $\log n$ with high probability. We further prove that the map is locally planar with high probability. The main ingredient of the proofs is an exploration procedure which uses a bijection due to Chapuy, Feray and Fusy.

2014-03-28math.PR

Unicellular maps vs hyperbolic surfaces in large genus: simple closed curves

We study uniformly random maps with a single face, genus $g$, and size $n$, as $n,g\rightarrow \infty$ with $g = o(n)$, in continuation of several previous works on the geometric properties of "high genus maps". We calculate the number of short simple cycles, and we show convergence of their lengths (after a well-chosen rescaling of the graph distance) to a Poisson process, which happens to be exactly the same as the limit law obtained by Mirzakhani and Petri (2019) when they studied simple closed geodesics on random hyperbolic surfaces under the Weil-Petersson measure as $g\rightarrow \infty$…

2021-12-10math.COmath.GTmath.PR

更多相关论文收起更多论文

The mesoscopic geometry of sparse random maps

We investigate the structure of large uniform random maps with $n$ edges, $\mathrm{f}_n$ faces, and with genus $\mathrm{g}_n$ in the so-called sparse case, where the ratio between the number vertices and edges tends to $1$. We focus on two regimes: the planar case $(\mathrm{f}_n, 2\mathrm{g}_n) = (\mathrm{s}_n, 0)$ and the unicellular case with moderate genus $(\mathrm{f}_n, 2 \mathrm{g}_n) = (1, \mathrm{s}_n-1)$, both when $1 \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 dec…

2021-12-20math.COmath.PR

双变量渐进行为 via 随机游走：应用于大亏格地图

Bivariate asymptotics via random walks: application to large genus maps

Université de Tours（图尔大学）；Univ Gustave Eiffel, CNRS, LIGM（巴黎-布里埃斯特大学，法国国家科学研究中心，信息与数字科学实验室）；CNRS and Institut de Mathématiques de Toulouse（法国国家科学研究中心和图卢兹数学研究所）；Institute of Discrete Mathematics, TU Graz（格拉茨工业大学离散数学研究所）；Institute of Discrete Mathematics and Geometry, TU Wien（维也纳工业大学离散数学与几何研究所）

研究双变量渐进行为，探讨大亏格地图数量的渐近行为，通过线性递推关系方法，提供一般定理以推导其他线性递推关系的渐近行为。

2026-10-14math.COmath.PR

Random generation and scaling limits of fixed genus factorizations into transpositions

We study the asymptotic behaviour of random factorizations of the $n$-cycle into transpositions of fixed genus $g>0$. They have a geometric interpretation as branched covers of the sphere and their enumeration as Hurwitz numbers was extensively studied in algebraic combinatorics and enumerative geometry. On the probabilistic side, several models and properties of permutation factorizations were studied in previous works, in particular minimal factorizations of cycles into transpositions (which corresponds to the case $g=0$ of this work). Using the representation of factorizations via unicellul…

2021-05-07math.COmath.PR