Asymptotics of largest components in combinatorial structures

DOI10.1007/S00453-006-0103-YMaRDI QIDQ866953zbMATH OpenOpenAlexFDO

Authors Mohamed Omar, Daniel Panario, Bruce Richmond, Jacki Whitely

Publication date 14 February 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-006-0103-y

zbMATH Keywords

Dickman function

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial probability (60C05)

Recommendations

• Asymptotics of combinatorial structures with large smallest component
• Largest component in random combinatorial structures
• scientific article; zbMATH DE number 5763331
• Order statistics for decomposable combinatorial structures
• Random combinatorial structures: the convergent case

Cited in

(11)

• scientific article; zbMATH DE number 2127754 (Why is no real title available?)
• scientific article; zbMATH DE number 1995883 (Why is no real title available?)
• On the largest part size of low‐rank combinatorial assemblies
• scientific article; zbMATH DE number 3874387 (Why is no real title available?)
• Limiting distributions for the number of distinct component sizes in relational structures
• Part sizes of smooth supercritical compositional structures
• Asymptotics of combinatorial structures with large smallest component
• Smallest components in decomposable structures: Exp-log class
• A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
• scientific article; zbMATH DE number 5763331 (Why is no real title available?)
• Analytic number theory for 0-cycles

This page was built for publication: Asymptotics of largest components in combinatorial structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866953)