Largest component in random combinatorial structures
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.
- Asymptotics of largest components in combinatorial structures
- Asymptotics of smallest component sizes in decomposable structures of alg-log type
- Random combinatorial structures: the convergent case
- Exact largest and smallest size of components
- Order statistics for decomposable combinatorial structures
- Automatic average-case analysis of algorithms
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- scientific article; zbMATH DE number 3655074 (Why is no real title available?)
- scientific article; zbMATH DE number 16479 (Why is no real title available?)
- scientific article; zbMATH DE number 3593676 (Why is no real title available?)
- scientific article; zbMATH DE number 3226335 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Mellin transforms and asymptotics: Harmonic sums
- On random mapping patterns
- On the Altitude of Nodes in Random Trees
- Ordered Cycle Lengths in a Random Permutation
- Random mappings with constraints on coalescence and number of origins
- Singularity Analysis of Generating Functions
- The Cycle Construction
- The number of trees
- Une théorie combinatoire des séries formelles
- On the shape of random Pólya structures
- Local probabilities for random permutations without long cycles
- Part sizes of smooth supercritical compositional structures
- Asymptotic Properties of Some Minor-Closed Classes of Graphs
- Permutations without long or short cycles
- scientific article; zbMATH DE number 3874387 (Why is no real title available?)
- Asymptotics of smallest component sizes in decomposable structures of alg-log type
- Noncrossing trees are almost conditioned Galton–Watson trees
- Graph limits of random graphs from a subset of connected k-trees
- Longest interval between zeros of the tied-down random walk, the Brownian bridge and related renewal processes
- Exact largest and smallest size of components
- On the largest part size of low‐rank combinatorial assemblies
- Random cubic planar graphs converge to the Brownian sphere
- Enumeration of decomposable combinatorial structures with restricted patterns
- Gibbs partitions: a comprehensive phase diagram
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Composition schemes: q-enumerations and phase transitions in Gibbs models
- Phase transition for tree-rooted maps
- Scaling limit of graph classes through split decomposition
- Height of walks with resets, the Moran model, and the discrete Gumbel distribution
- Unified study of the phase transition for block-weighted random planar maps (extended abstract)
- Dense and nondense limits for uniform random intersection graphs
- Asymptotics of largest components in combinatorial structures
- Random preorders and alignments
This page was built for publication: Largest component in random combinatorial structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381824)
