We establish uniform sub-exponential tail bounds for the width, height and maximal
outdegree of critical Bienaymé–Galton–Watson trees conditioned on having a large fixed …

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly
sampled node in a random combinatorial tree, which we use to prove bounds on the heights …

Pólya trees are rooted trees considered up to symmetry. We establish the convergence of
large uniform random Pólya trees with arbitrary degree restrictions to Aldous' Continuum …

We develop an excursion theory for Brownian motion indexed by the Brownian tree, which in
many respects is analogous to the classical Itô theory for linear Brownian motion. Each …

We establish limit theorems that describe the asymptotic local and global geometric
behaviour of random enriched trees considered up to symmetry. We apply these general …

Many random recursive discrete structures may be described by a single generic model.
Adopting this perspective allows us to elegantly prove limits for these structures as instances …

In this paper, the scaling limit of random connected cubic planar graphs (respectively
multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main …

A class of graphs is called block-stable when a graph is in the class if and only if each of its
blocks is. We show that, as for trees, for most n-vertex graphs in such a class, each vertex is …

We consider the model of random planar maps of size n biased by a weight u> 0 per 2-
connected block, and the closely related model of random planar quadrangulations of size n …

We consider uniform random cographs (either labeled or unlabeled) of large size. Our first
main result is the convergence toward a Brownian limiting object in the space of graphons …