Related papers: Isoperimetric inequalities in the Brownian plane

For each $n\in\mathbb{N}$, let $\mathbf{Q}_n$ be a uniform rooted measured quadrangulation of size $n$ conditioned to have $r(n)$ vertices in its root block. We prove that for a suitable function $r(n)$, after rescaling graph distance by…

We consider the area of spheres centered at the distinguished point in the Brownian plane. As a function of the radius, the resulting process has continuously differentiable sample paths. Furthermore, the pair consisting of the process and…

Consider $q_n$ a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with $n$ faces. In this paper we show that, when $n$ goes to $+\infty$, $q_n$ suitably normalized converges weakly in a certain sense…

We show that, under certain natural assumptions, large random plane bipartite maps with a boundary converge after rescaling to a one-parameter family ($\mathrm{BD}_L$, $0 < L < \infty$) of random metric spaces homeomorphic to the closed…

We obtain upper bounds for the isoperimetric quotients of extrinsic balls of submanifolds in ambient spaces which have a lower bound on their radial sectional curvatures. The submanifolds are themselves only assumed to have lower bounds on…

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…

A Brownian loop is a random walk circuit of infinitely many, suitably infinitesimal, steps. In a plane such a loop may or may not enclose a marked point, the origin, say. If it does so it may wind arbitrarily many times, positive or…

Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…

We consider random genus-0 hyperbolic surfaces $\mathcal{S}_n$ with $n + 1$ punctures, sampled according to the Weil-Petersson measure. We show that, after rescaling the metric by $n^{-1/4}$, the surface $\mathcal{S}_n$ converges in…

We prove that properly rescaled large planar Eulerian triangulations converge to the Brownian map. This result requires more than a standard application of the methods that have been used to obtain the convergence of other families of…

The (standard) Brownian web is a collection of coalescing one- dimensional Brownian motions, starting from each point in space and time. It arises as the diffusive scaling limit of a collection of coalescing random walks. We show that it is…

We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…

The Brownian web is a collection of one-dimensional coalescing Brownian motions starting from every point in space and time, while the Brownian net is an extension that also allows branching. We show here that the Brownian net is the…

We prove that quadrangulations with a simple boundary converge to the Brownian disk. More precisely, we fix a sequence $(p_n)$ of even positive integers with $p_n\sim 2\alpha \sqrt{2n}$ for some $\alpha\in(0,\infty)$. Then, for the…

We construct a measure valued Markov process which we call infinite canonical super-Brownian motion, and which corresponds to the canonical measure of super-Brownian motion conditioned on non-extinction. Infinite canonical super-Brownian…

We establish a new spatial Markov property of the Brownian half-plane. According to this property, if one removes a hull centered at a boundary point, the remaining space equipped with an intrinsic metric is still a Brownian half-plane,…

Coalescing simple random walks in the plane form an infinite tree. A natural directed distance on this tree is given by the number of jumps between branches when one is only allowed to move in one direction. The Brownian web distance is the…

We prove that the uniform infinite half-plane quadrangulation (UIHPQ), with either general or simple boundary, equipped with its graph distance, its natural area measure, and the curve which traces its boundary, converges in the scaling…

We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…

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…