AbstractIt has been observed that for most classes of planar maps, the number of maps of size n grows asymptotically like c⋅n−5/2γn, for suitable positive constants c and γ. It has also been observed that, if dk is the limit probability that the root vertex in a random map has degree k, then again for most classes of maps the tail of the distribution is asymptotically of the form dk∼c⋅k1/2qk as k→∞, for positive constants c, q with q<1.We provide a rationale for this universal behaviour in terms of analytic conditions on the associated generating functions. The fact that generating functions for maps satisfy as a rule a quadratic equation with one catalytic variable, allows us to identify a critical condition implying the shape of the above...
International audienceWe prove that a uniform rooted plane map with n edges converges in distributio...
We study a configuration model on bipartite planar maps where, given $n$ even integers, one samples ...
International audienceWe show that the diameter $D(G_n)$ of a random (unembedded) labelled connected...
AbstractIt has been observed that for most classes of planar maps, the number of maps of size n grow...
AbstractWe prove that for each k⩾0, the probability that a root vertex in a random planar graph has ...
AbstractLet a vertex be selected at random in a set ofn-edged rooted planar maps andpkdenote the lim...
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on th...
We consider random rooted maps without regard to their genus, with fixed large number of edges, and ...
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several par...
We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has d...
The purpose of this paper is to provide a central limit theorem for the number of occurrences of dou...
We determine the number of labelled chordal planar graphs with n vertices, which is asymptotically f...
26 pages, 4 figuresFor non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) =...
The goal of our work is to analyze random cubic planar graphs according to the uniform distribution....
AbstractWe show that the number gn of labelled series–parallel graphs on n vertices is asymptoticall...
International audienceWe prove that a uniform rooted plane map with n edges converges in distributio...
We study a configuration model on bipartite planar maps where, given $n$ even integers, one samples ...
International audienceWe show that the diameter $D(G_n)$ of a random (unembedded) labelled connected...
AbstractIt has been observed that for most classes of planar maps, the number of maps of size n grow...
AbstractWe prove that for each k⩾0, the probability that a root vertex in a random planar graph has ...
AbstractLet a vertex be selected at random in a set ofn-edged rooted planar maps andpkdenote the lim...
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on th...
We consider random rooted maps without regard to their genus, with fixed large number of edges, and ...
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several par...
We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has d...
The purpose of this paper is to provide a central limit theorem for the number of occurrences of dou...
We determine the number of labelled chordal planar graphs with n vertices, which is asymptotically f...
26 pages, 4 figuresFor non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) =...
The goal of our work is to analyze random cubic planar graphs according to the uniform distribution....
AbstractWe show that the number gn of labelled series–parallel graphs on n vertices is asymptoticall...
International audienceWe prove that a uniform rooted plane map with n edges converges in distributio...
We study a configuration model on bipartite planar maps where, given $n$ even integers, one samples ...
International audienceWe show that the diameter $D(G_n)$ of a random (unembedded) labelled connected...