





























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。