The forgetfulness of balls and bins

DOI10.1002/rsa.20408zbMath1259.05152arXiv1004.5373OpenAlexW2013792709MaRDI QIDQ4909203

Will Perkins

Publication date: 12 March 2013

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

Full work available at URL: https://arxiv.org/abs/1004.5373

zbMATH Keywords

detectionrandom structuresballs-and-binsplanted distributions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Normal approximations to sums of scores based on occupancy numbers
• A Berry-Esseen bound for an occupancy problem
• Expected complexity of graph partitioning problems
• Higher criticism for detecting sparse heterogeneous mixtures.
• Why Almost All k-Colorable Graphs Are Easy
• Finding hidden hamiltonian cycles
• Probability

This page was built for publication: The forgetfulness of balls and bins