Largest component in random combinatorial structures

DOI10.1016/S0012-365X(97)00115-5zbMath0898.60014MaRDI QIDQ1381824

Xavier Gourdon

Publication date: 1 November 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionstreesrandom mappingsrandom combinatorial structurealgebraic-logarithmic type

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items

Local probabilities for random permutations without long cycles ⋮ Noncrossing trees are almost conditioned Galton–Watson trees ⋮ Permutations without long or short cycles ⋮ Part Sizes of Smooth Supercritical Compositional Structures ⋮ Asymptotic Properties of Some Minor-Closed Classes of Graphs ⋮ On the largest part size of low‐rank combinatorial assemblies ⋮ Random cubic planar graphs converge to the Brownian sphere ⋮ On the shape of random Pólya structures ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Random preorders and alignments ⋮ 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

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