Largest component in random combinatorial structures
From MaRDI portal
Publication:1381824
DOI10.1016/S0012-365X(97)00115-5zbMath0898.60014MaRDI QIDQ1381824
Publication date: 1 November 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
generating functions; trees; random mappings; random combinatorial structure; algebraic-logarithmic type
60C05: Combinatorial probability
Related Items
Noncrossing trees are almost conditioned Galton–Watson trees, Enumeration of decomposable combinatorial structures with restricted patterns, Random preorders and alignments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Harmonic sums
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- On random mapping patterns
- Random mappings with constraints on coalescence and number of origins
- Une théorie combinatoire des séries formelles
- Automatic average-case analysis of algorithms
- The number of trees
- The Cycle Construction
- Singularity Analysis of Generating Functions
- On the Altitude of Nodes in Random Trees
- Ordered Cycle Lengths in a Random Permutation