Add to ORKGGiven integers m and n, we study the probability that structures of size n have all components of size at most m. The results are given in term of a generalized Dickman function of n/m
We prove a joint local limit law for the distribution of the r largest components of decomposable lo...
In our previous work [paper1], we derived an asymptotic expression for the probability that a random...
We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we deriv...
Given integers m and n, we study the probability that structures of size n have all components of si...
We study the probability of connectedness for structures of size n when all components must have siz...
A decomposable combinatorial structure consists of simpler objects called components which by thems ...
Golomb and Gaal [15] study the number of permutations on n objects with largest cycle length equal t...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
AbstractWe present a unified analytic framework dedicated to the estimation of the size of the large...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
AbstractThis paper studies the distribution of the component spectrum of combinatorial structures su...
The smallest size of components in random decomposable combinatorial structures is studied in a gene...
We prove a joint local limit law for the distribution of the r largest components of decomposable lo...
In our previous work [paper1], we derived an asymptotic expression for the probability that a random...
We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we deriv...
Given integers m and n, we study the probability that structures of size n have all components of si...
We study the probability of connectedness for structures of size n when all components must have siz...
A decomposable combinatorial structure consists of simpler objects called components which by thems ...
Golomb and Gaal [15] study the number of permutations on n objects with largest cycle length equal t...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
AbstractWe present a unified analytic framework dedicated to the estimation of the size of the large...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
We study the largest component of a random (multi)graph on n vertices with a given degree sequence. ...
AbstractThis paper studies the distribution of the component spectrum of combinatorial structures su...
The smallest size of components in random decomposable combinatorial structures is studied in a gene...
We prove a joint local limit law for the distribution of the r largest components of decomposable lo...
In our previous work [paper1], we derived an asymptotic expression for the probability that a random...
We study the 'rank 1 case' of the inhomogeneous random graph model. In the subcritical case we deriv...