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...
We determine the limiting distribution of the maximum vertex degree 2 n in a random triangulation of...
AbstractWe determine the limiting distribution of the maximum vertex degree Δn in a random triangula...
Catalytic equations appear in several combinatorial applications, most notably in the enumeration of...
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 ...
We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has d...
AbstractLet a vertex be selected at random in a set ofn-edged rooted planar maps andpkdenote the lim...
The purpose of this paper is to provide a central limit theorem for the number of occurrences of dou...
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several par...
26 pages, 4 figuresFor non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) =...
We consider random rooted maps without regard to their genus, with fixed large number of edges, and ...
A considerable number of asymptotic distributions arising in random combinatorics and analysis of al...
Colloque avec actes et comité de lecture. internationale.International audienceA considerable number...
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on th...
International audienceIt is shown that the number of labelled graphs with $n$ vertices that can be e...
We determine the limiting distribution of the maximum vertex degree 2 n in a random triangulation of...
AbstractWe determine the limiting distribution of the maximum vertex degree Δn in a random triangula...
Catalytic equations appear in several combinatorial applications, most notably in the enumeration of...
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 ...
We prove that for each $k \geq 0$, the probability that a root vertex in a random planar graph has d...
AbstractLet a vertex be selected at random in a set ofn-edged rooted planar maps andpkdenote the lim...
The purpose of this paper is to provide a central limit theorem for the number of occurrences of dou...
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several par...
26 pages, 4 figuresFor non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) =...
We consider random rooted maps without regard to their genus, with fixed large number of edges, and ...
A considerable number of asymptotic distributions arising in random combinatorics and analysis of al...
Colloque avec actes et comité de lecture. internationale.International audienceA considerable number...
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on th...
International audienceIt is shown that the number of labelled graphs with $n$ vertices that can be e...
We determine the limiting distribution of the maximum vertex degree 2 n in a random triangulation of...
AbstractWe determine the limiting distribution of the maximum vertex degree Δn in a random triangula...
Catalytic equations appear in several combinatorial applications, most notably in the enumeration of...