Abstract
AbstractConsider a finite or infinite collection of urns, each with capacity r, and balls randomly distributed among them. An overflow is the number of balls that are assigned to urns that already contain r balls. When
$r=1$
, this is the number of balls landing in non-empty urns, which has been studied in the past. Our aim here is to use martingale methods to study the asymptotics of the overflow in the general situation, i.e. for arbitrary r. In particular, we provide sufficient conditions for both Poissonian and normal asymptotics.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference23 articles.
1. Probability inequalities for certain multivariate discrete distribution;Jogdeo;Sankhyā B,1975
2. Small counts in the infinite occupancy scheme
3. Central limit theorems for martingales with discrete or continuous time;Helland;Scand. J. Statist.,1982
4. Computing the probability of hash table/urn overflow