Records in the Infinite Occupancy Scheme
Abstract
We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability pj of hitting box j. Each time a box receives its first ball we speak of a record and, more generally, call an r-record every event when a box receives its rth ball. Assuming that the sequence (pj) is not decaying too fast, we show that after many balls have been thrown, the suitably scaled point process of r-record times is approximately Poisson. The joint convergence of r-record processes is argued under a condition of regular variation.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.