Searcharxiv⌕ Search

arXiv subjects

Grégory Miermont

Publications and source records attributed to Grégory Miermont.

At least 19 recordsLinked to original sources

Enumeration of maps with tight boundaries and the Zhukovsky transformation

We consider maps with tight boundaries, i.e. maps whose boundaries have minimal length in their homotopy class, and discuss the properties of their generating functions $T^{(g)}_{\ell_1,\ldots,\ell_n}$ for fixed genus $g$ and prescribed boundary lengths $\ell_1,\ldots,\ell_n$, with a control on the degrees of inner faces. We find that these series appear as coefficients in the expansion of $ω^{(g)}_n(z_1,\ldots,z_n)$, a fundamental quantity in the Eynard-Orantin theory of topological recursion, thereby providing a combinatorial interpretation of the Zhukovsky transformation used in this context. This interpretation results from the so-called trumpet decomposition of maps with arbitrary boundaries. In the planar bipartite case, we obtain a fully explicit formula for $T^{(0)}_{2\ell_1,\ldots,2\ell_n}$ from the Collet-Fusy formula. We also find recursion relations satisfied by $T^{(g)}_{\ell_1,\ldots,\ell_n}$, which consist in adding an extra tight boundary, keeping the genus $g$ fixed. Building on a result of Norbury and Scott, we show that $T^{(g)}_{\ell_1,\ldots,\ell_n}$ is equal to a parity-dependent quasi-polynomial in $\ell_1^2,\ldots,\ell_n^2$ times a simple power of the basic generating function $R$. In passing, we provide a bijective derivation in the case $(g,n)=(0,3)$, generalizing a recent construction of ours to the non bipartite case.

math.CO↗

Ancestral diversity in fragmentation trees

In a deterministic or random tree, a notion of ancestral diversity can be defined as follows. Sample independently $n$ groups of $k$ leaves and count the number $N_n(k)$ of distinct most recent common ancestors of each of the groups. As $n$ becomes large, the asymptotic behavior of $N_n(k)$ depends of course on the structure of the tree. Motivated by the study of the edge density in the Brownian co-graphon, Chapuy recently considered this problem in the case where $k=2$ and where the tree is the Brownian continuum random tree. We vastly extend this framework by considering general values of $k$ and general fragmentation trees, which include some prominent examples such as stable Lévy trees and idealized models of phylogenetic trees. Other natural ancestral statistics are also considered. For a given tree model, we identify a phase transition-like phenomenon, with different asymptotic regimes for $N_k(n)$, depending on the position of $k$ relative to a model-dependent critical value.

math.PR↗

Compact Brownian surfaces II. Orientable surfaces

Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this quadrangulation with the usual graph metric renormalized by $n^{-1/4}$, mark it on each boundary component, and endow it with the counting measure on its vertex set renormalized by $n^{-1}$, as well as the counting measure on each boundary component renormalized by $n^{-1/2}$. We show that, as $n\to\infty$, this random marked measured metric space converges in distribution for the Gromov--Hausdorff--Prokhorov topology, toward a random limiting marked measured metric space called a Brownian surface. This extends known convergence results of uniform random planar quadrangulations with at most one boundary component toward the Brownian sphere and toward the Brownian disk, by considering the case of quadrangulations on general compact orientable surfaces. Our approach consists in cutting a Brownian surface into elementary pieces that are naturally related to the Brownian sphere and the Brownian disk and their noncompact analogs, the Brownian plane and the Brownian half-plane, and to prove convergence results for these elementary pieces, which are of independent interest.

math.PR↗

The scaling limit of planar maps with large faces

We prove that large Boltzmann stable planar maps of index $α\in (1;2)$ converge in the scaling limit towards a random compact metric space $\mathcal{S}_α$ that we construct explicitly. They form a one-parameter family of random continuous spaces ``with holes'' or ``faces'' different from the Brownian sphere. In the so-called dilute phase $α\in [3/2;2)$, the topology of $\mathcal{S}_α$ is that of the Sierpinski carpet, while in the dense phase $α\in (1;3/2)$ the ``faces'' of $\mathcal{S}_α$ may touch each-others. En route, we prove various geometric properties of these objects concerning their faces or the behavior of geodesics.

math.PR↗

The snake in the Brownian sphere

The Brownian sphere is a random metric space, homeomorphic to the two-dimensional sphere, which arises as the universal scaling limit of many types of random planar maps. The direct construction of the Brownian sphere is via a continuous analogue of the Cori--Vauquelin--Schaeffer (CVS) bijection. The CVS bijection maps labeled trees to planar maps, and the continuous version maps Aldous' continuum random tree with Brownian labels (the Brownian snake) to the Brownian sphere. In this work, we describe the inverse of the continuous CVS bijection, by constructing the Brownian snake as a measurable function of the Brownian sphere. Special care is needed to work with the orientation of the Brownian sphere.

math.PR↗

A large deviation principle for the normalized excursion of $α$-stable Lévy processes without negative jumps

We establish a large deviation principle for the normalized excursion and bridge of an $α$-stable Lévy process without negative jumps, with $1<α<2$. Based on this, we derive precise asymptotics for the tail distributions of functionals of the normalized excursion and bridge, in particular, the area and maximum functionals. We advocate the use of the Skorokhod M1 topology, rather than the more usual J1 topology, as we believe it is better suited to large deviation principles for Lévy processes in general.

math.PR↗

On quasi-polynomials counting planar tight maps

A tight map is a map with some of its vertices marked, such that every vertex of degree $1$ is marked. We give an explicit formula for the number $N_{0,n}(d_1,\ldots,d_n)$ of planar tight maps with $n$ labeled faces of prescribed degrees $d_1,\ldots,d_n$, where a marked vertex is seen as a face of degree $0$. It is a quasi-polynomial in $(d_1,\ldots,d_n)$, as shown previously by Norbury. Our derivation is bijective and based on the slice decomposition of planar maps. In the non-bipartite case, we also rely on enumeration results for two-type forests. We discuss the connection with the enumeration of non necessarily tight maps. In particular, we provide a generalization of Tutte's classical slicings formula to all non-bipartite maps.

math.CO↗

Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants

We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by Collet and Fusy. In this paper, we obtain an even simpler formula for \emph{tight} pairs of pants, namely for maps whose boundaries have minimal length in their homotopy class. We follow a bijective approach based on the slice decomposition, which we extend by introducing new fundamental building blocks called bigeodesic triangles and diangles, and by working on the universal cover of the triply punctured sphere. We also discuss the statistics of the lengths of minimal separating loops in (non necessarily tight) pairs of pants and annuli, and their asymptotics in the large volume limit.

math.CO↗

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

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.

math.PR↗

Backbone scaling limit of the high-dimensional IIC: extended version

We identify the scaling limit of the backbone of the high-dimensional incipient infinite cluster (IIC), both in the finite-range and the long-range setting. In the finite-range setting, this scaling limit is Brownian motion, in the long-range setting, it is a stable motion. The proof relies on a novel lace expansion that keeps track of the number of pivotal bonds.

math.PR↗

A Boltzmann approach to percolation on random triangulations

We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either site-percolation or bond-percolation) on this triangulation. By enumerating triangulations with boundaries according to both the boundary length and the number of vertices/edges on the boundary, we are able to identify a phase transition for the geometry of the origin cluster. For instance, we show that the probability that a percolation interface has length n decays exponentially with n except at a particular value p\_c of the percolation parameter p for which the decay is polynomial (of order n --10/3). Moreover, the probability that the origin cluster has size n decays exponentially if p < p c and polynomially if p $\ge$ p\_c. The critical percolation value is p\_c = 1/2 for site percolation, and p c = 2 $\sqrt$ 3--1 11 for bond percolation. These values coincide with critical percolation thresholds for infinite triangula-tions identified by Angel for site-percolation, and by Angel \& Curien for bond-percolation, and we give an independent derivation of these percolation thresholds. Lastly, we revisit the criticality conditions for random Boltzmann maps, and argue that at p\_c , the percolation clusters conditioned to have size n should converge toward the stable map of parameter 7 6 introduced by Le Gall \& Miermont. This enables us to derive heuristically some new critical exponents.

math.CO↗

Geodesic rays in the uniform infinite half-planar quadrangulation return to the boundary

We show that all geodesic rays in the uniform infinite half-planar quadrangulation (UIHPQ) intersect the boundary infinitely many times, answering thereby a recent question of Curien. However, the possible intersection points are sparsely distributed along the boundary. As an intermediate step, we show that geodesic rays in the UIHPQ are proper, a fact that was recently established by Caraceni and Curien (2015) by a reasoning different from ours. Finally, we argue that geodesic rays in the uniform infinite half-planar triangulation behave in a very similar manner, even in a strong quantitative sense.

math.PR↗

Stability of geodesics in the Brownian map

The Brownian map is a random geodesic metric space arising as the scaling limit of random planar maps. We strengthen the so-called confluence of geodesics phenomenon observed at the root of the map, and with this, reveal several properties of its rich geodesic structure. Our main result is the continuity of the cut locus at typical points. A small shift from such a point results in a small, local modification to the cut locus. Moreover, the cut locus is uniformly stable, in the sense that any two cut loci coincide outside a closed, nowhere dense set of zero measure. We obtain similar stability results for the set of points inside geodesics to a fixed point. Furthermore, we show that the set of points inside geodesics of the map is of first Baire category. Hence, most points in the Brownian map are endpoints. Finally, we classify the types of geodesic networks which are dense. For each $k\in\{1,2,3,4,6,9\}$, there is a dense set of pairs of points which are joined by networks of exactly $k$ geodesics and of a specific topological form. We find the Hausdorff dimension of the set of pairs joined by each type of network. All other geodesic networks are nowhere dense.

math.PR↗

Long Brownian bridges in hyperbolic spaces converge to Brownian trees

We show that the range of a long Brownian bridge in the hyperbolic space converges after suitable renormalisation to the Brownian continuum random tree. This result is a relatively elementary consequence of $\bullet$ A theorem by Bougerol and Jeulin, stating that the rescaled radial process converges to the normalized Brownian excursion, $\bullet$ A property of invariance under re-rooting, $\bullet$ The hyperbolicity of the ambient space in the sense of Gromov. A similar result is obtained for the rescaled infinite Brownian loop in hyperbolic space.

math.PR↗

Classification of scaling limits of uniform quadrangulations with a boundary

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe different limiting metric spaces. Among well-known objects like the Brownian plane or the infinite continuum random tree, we construct two new one-parameter families of metric spaces that appear as scaling limits: the Brownian half-plane with skewness parameter $θ$ and the infinite-volume Brownian disk of perimeter $σ$. We also obtain various coupling and limit results clarifying the relation between these objects.

math.PR↗

Backbone scaling limit of the high-dimensional IIC

We identify the scaling limit of the backbone of the high-dimensional incipient infinite cluster (IIC), both in the long- as well as in the finite-range setting. In the finite-range setting, this scaling limit is Brownian motion, in the long-range setting, it is a stable motion. The proof relies on a novel lace expansion for percolation that resembles the original expansion for self-avoiding walks by Brydges and Spencer in 1985. This expansion is interesting in its own right.

math.PR↗

The cut-tree of large Galton-Watson trees and the Brownian CRT

Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this edge-deletion process. Our main result shows that after a proper rescaling, the cut-tree of a critical Galton-Watson tree with finite variance and conditioned to have size n, converges as $n\to\infty$ to a Brownian continuum random tree (CRT) in the weak sense induced by the Gromov-Prokhorov topology. This yields a multi-dimensional extension of a limit theorem due to Janson [Random Structures Algorithms 29 (2006) 139-179] for the number of random cuts needed to isolate the root in Galton-Watson trees conditioned by their sizes, and also generalizes a recent result [Ann. Inst. Henri Poincaré Probab. Stat. (2012) 48 909-921] obtained in the special case of Cayley trees.

math.PR↗