On the largest part size of low‐rank combinatorial assemblies

DOI10.1002/rsa.21132zbMath1523.60022MaRDI QIDQ6074710

Richard Arratia, Stephen DeSalvo

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

zbMATH Keywords

selectionsmultisetsBoltzmann samplerassembliesdecomposable combinatorial structure

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded size bias coupling: a gamma function bound, and universal Dickman-function behavior
• Completely effective error bounds for Stirling numbers of the first and second kinds via Poisson approximation
• Asymptotics of largest components in combinatorial structures
• Cycle lengths in a permutation are typically Poisson
• Une théorie combinatoire des séries formelles
• The cycle structure of random permutations
• Independent process approximations for random combinatorial structures
• Largest component in random combinatorial structures
• Logarithmic combinatorial structures: A probabilistic approach
• Saddlepoint methods and statistical inference. With comments and a rejoinder by the author
• Probabilistic divide-and-conquer: deterministic second half
• Théorie géométrique des polynômes eulériens
• Approximate formulas for some functions of prime numbers
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Asymptotics of the Stirling numbers of the second kind revisited
• Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example
• Ordered Cycle Lengths in a Random Permutation
• Saddlepoint Approximations in Statistics

This page was built for publication: On the largest part size of low‐rank combinatorial assemblies