Related papers: The scaling limit of random 2-connected series-par…
We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we…
We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…
A planar map is outerplanar if all its vertices belong to the same face. We show that random uniform outerplanar maps with $n$ vertices suitably rescaled by a factor $1/ \sqrt{n}$ converge in the Gromov-Hausdorff sense to…
We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least…
We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…
We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…
We discuss the scaling limit of large planar quadrangulations with a boundary whose length is of order the square root of the number of faces. We consider a sequence $(\sigma_n)$ of integers such that $\sigma_n/\sqrt{2n}$ tends to some…
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…
We prove that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set converges in the Gromov-Hausdorff sense after a suitable rescaling to the Brownian continuum random tree. This proves a conjecture by…
We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
The continuum random tree is the scaling limit of the uniform spanning tree on the complete graph with $N$ vertices. The Aldous-Broder chain on a graph $G=(V,E)$ is a discrete-time stochastic process with values in the space of rooted trees…
We prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhorov topology, of uniform random graphs in each of the three following families of graphs: distance-hereditary graphs, $2$-connected…
We prove that a uniform, rooted unordered binary tree with $n$ vertices has the Brownian continuum random tree as its scaling limit for the Gromov-Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform…
We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…
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…
We prove that a uniform rooted plane map with n edges converges in distribution after a suitable normalization to the Brownian map for the Gromov-Hausdorff topology. A recent bijection due to Ambj{\o}rn and Budd allows to derive this result…
Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…