English

Records in the Infinite Occupancy Scheme

Probability 2024-11-14 v1

Abstract

We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability pjp_j of hitting box jj. Each time a box receives its first ball we speak of a record and, more generally, call an rr-record every event when a box receives its rrth ball. Assuming that the sequence (pj)(p_j) is not decaying too fast, we show that after many balls have been thrown, the suitably scaled point process of rr-record times is approximately Poisson. The joint convergence of rr-record processes is argued under a condition of regular variation.

Keywords

Cite

@article{arxiv.2308.01739,
  title  = {Records in the Infinite Occupancy Scheme},
  author = {Zakaria Derbazi and Alexander Gnedin and Alexander Marynych},
  journal= {arXiv preprint arXiv:2308.01739},
  year   = {2024}
}

Comments

23 pages

R2 v1 2026-06-28T11:47:19.690Z