Balls and Bins -- Simple Concentration Bounds

Abstract

Concentration bounds are given for throwing balls into bins independently according to a distribution p. The probability of a k-loaded bin after m balls is shown to be controlled on both sides by m,k := m \|p\|k / k. This gives concentration inequalities for the maximum load as well as for the waiting time until a k-loaded bin.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…