Balls and Bins -- Simple Concentration Bounds
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:O5Q4AYAJrecord.jsonopen to challenge →
classification
math.PR
keywords
ballsconcentrationbinsboundsloadedaccordingcontrolleddistribution
read the original 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 $\rho_{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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.