Related papers: Random cubic planar maps

We provide precise asymptotic estimates for the number of several classes of labelled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by Bodirsky et al.…

We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…

We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…

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,…

We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…

We present a probabilistic approach to the core-size in random maps, which yields straightforward and singularity analysis-free proofs of some results of Banderier, Flajolet, Schaeffer and Soria. The proof also yields convergence in…

We prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…

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…

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…

In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a…

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

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 investigate the structure of large uniform random maps with $n$ edges, $\mathrm{f}_n$ faces, and with genus $\mathrm{g}_n$ in the so-called sparse case, where the ratio between the number vertices and edges tends to $1$. We focus on two…

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…

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 study the geometry of a random unicellular map which is uniformly distributed on the set of all unicellular maps whose genus size is proportional to the number of edges of the map. We prove that the distance between two uniformly…

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…

We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…

A recent preprint (arXiv:1402.2632) introduced a growth procedure for planar maps, whose almost sure limit is "the uniform infinite 3-connected planar map". A classical construction of Brooks, Smith, Stone and Tutte (1940) associates a…