Largest component in random combinatorial structures (Q1381824)

The size \(L\) of the largest component in a random combinatorial structure of size \(n\) with generating function of type \(C(z)= F(P(z))\) is studied. For generating functions of so-called algebraic-logarithmic type explicit asymptotic estimates for distributions, means and variances are obtained for some classical combinatorial structures. The estimates are based on detailed analyses of how \(F\) and \(P\) induce the singularity of \(C\). This gives a subdivision into three cases with three prototypical examples: the largest root subtree in a random unlabelled rooted tree, the largest tree in a random mapping and the largest summand in a random integer composition.