Related papers: Random cubic planar graphs converge to the Brownia…

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…

We study the double- and triple-scaling limits of a complex multi-matrix model, with $\mathrm{U}(N)^2\times \mathrm{O}(D)$ symmetry. The double-scaling limit amounts to taking simultaneously the large-$N$ (matrix size) and large-$D$ (number…

We introduce and study a new random surface which we call the hyperbolic Brownian plane and which is the near-critical scaling limit of the hyperbolic triangulations constructed in arXiv:1401.3297. The law of the hyperbolic Brownian plane…

Kenyon, Miller, Sheffield, and Wilson (2015) showed how to encode a random bipolar-oriented planar map by means of a random walk with a certain step size distribution. Using this encoding together with the mating-of-trees construction of…

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…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

For every integer $n\geq 1$, we consider a random planar map $\mathcal{M}_n$ which is uniformly distributed over the class of all rooted bipartite planar maps with $n$ edges. We prove that the vertex set of $\mathcal{M}_n$ equipped with the…

We prove that the free Boltzmann quadrangulation with simple boundary and fixed perimeter, equipped with its graph metric, natural area measure, and the path which traces its boundary converges in the scaling limit to the free Boltzmann…

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…

We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…

We study the scaling limit of essentially simple triangulations on the torus. We consider, for every $n\geq 1$, a uniformly random triangulation $G_n$ over the set of (appropriately rooted) essentially simple triangulations on the torus…

Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular…

We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…

We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least…

We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…

We give a new construction of the Brownian annulus based on removing a hull centered at the distinguished point in the free Brownian disk. We use this construction to prove that the Brownian annulus is the scaling limit of Boltzmann…

The question of understanding the scaling limit of metric graph critical loop soup clusters and its relation to loop soups in the continuum appears to be one of the subtle cases that reveal interesting new scenarios about scaling limits,…

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 consider the rank-1 inhomogeneous random graph in the Brownian regime in the critical window. Aldous studied the weights of the components, and showed that this ordered sequence converges in the $\ell^2$-topology to the ordered…

Whitney proved that 3-connected planar graphs admit a unique embedding on the sphere. In contrast, Enami investigated embeddings of 3-connected cubic planar graphs on non-spherical surfaces with non-negative Euler characteristic. He…