Add to ORKGA 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/n−−√ converge in the Gromov–Hausdorff sense to 72–√/9 times Aldous’ Brownian tree. The proof uses the bijection of Bonichon, Gavoille and Hanusse (J. Graph Algorithms Appl. 9 (2005) 185–204). </p
International audienceLet M-n be a simple triangulation of the sphere S-2, drawn uniformly at random...
We prove that random triangulations of types I, II, and III with a simple boundary under the critica...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
76 pages, 7 figures, improved versionWe prove that uniform random quadrangulations of the sphere wit...
Abstract. For every integer n ≥ 1, we consider a random planar map Mn which is uniformly distributed...
Random planar maps are considered in the physics literature as the dis-crete counterpart of random s...
We discuss scaling limits of random planar maps chosen uniformly over the set of all 2p-angulations ...
We prove that uniform random quadrangulations of the sphere with n faces, endowed with the usual gra...
26 pages, 4 figuresFor non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) =...
Abstract. We study the uniform random graph Cn with n vertices drawn from a subcritical class of con...
International audienceWe prove that a uniform rooted plane map with n edges converges in distributio...
The main purpose of this work is to provide a framework for proving that, given a family of random m...
In the first part, we show that a uniform quadrangulation, its largest 2-connected block, and its la...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
We study a configuration model on bipartite planar maps where, given $n$ even integers, one samples ...
International audienceLet M-n be a simple triangulation of the sphere S-2, drawn uniformly at random...
We prove that random triangulations of types I, II, and III with a simple boundary under the critica...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...
76 pages, 7 figures, improved versionWe prove that uniform random quadrangulations of the sphere wit...
Abstract. For every integer n ≥ 1, we consider a random planar map Mn which is uniformly distributed...
Random planar maps are considered in the physics literature as the dis-crete counterpart of random s...
We discuss scaling limits of random planar maps chosen uniformly over the set of all 2p-angulations ...
We prove that uniform random quadrangulations of the sphere with n faces, endowed with the usual gra...
26 pages, 4 figuresFor non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) =...
Abstract. We study the uniform random graph Cn with n vertices drawn from a subcritical class of con...
International audienceWe prove that a uniform rooted plane map with n edges converges in distributio...
The main purpose of this work is to provide a framework for proving that, given a family of random m...
In the first part, we show that a uniform quadrangulation, its largest 2-connected block, and its la...
We show that the uniform unlabelled unrooted tree with n vertices and vertex degrees in a fixed set ...
We study a configuration model on bipartite planar maps where, given $n$ even integers, one samples ...
International audienceLet M-n be a simple triangulation of the sphere S-2, drawn uniformly at random...
We prove that random triangulations of types I, II, and III with a simple boundary under the critica...
We study a model of random R-enriched trees that is based on weights on the R-structures and allows ...