Records in the Infinite Occupancy Scheme
arXiv:2308.01739 · doi:10.30757/ALEA.v21-55
Abstract
We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability of hitting box . Each time a box receives its first ball we speak of a record and, more generally, call an -record every event when a box receives its th ball. Assuming that the sequence is not decaying too fast, we show that after many balls have been thrown, the suitably scaled point process of -record times is approximately Poisson. The joint convergence of -record processes is argued under a condition of regular variation.
arXiv comment23 pages
References in corpus (6)
- Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws
- Asymptotic laws for compositions derived from transformed subordinators
- Local limit theorems for finite and infinite urn models
- Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications
- On the variance of the number of occupied boxes
- Convergence of point processes associated with coupon collector's and Dixie cup problems