pith. sign in

arxiv: 1905.06663 · v1 · pith:JLMK5SFDnew · submitted 2019-05-16 · 🧮 math.PR

Asymptotics of the overflow in urn models

classification 🧮 math.PR
keywords ballsnumberoverflowasymptoticsurnsconditionsgeneralmethods
0
0 comments X
read the original abstract

Consider a number, finite or not, of urns each with fixed 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$, using analytic methods, Hwang and Janson gave conditions under which the overflow (which in this case is just the number of balls landing in non--empty urns) has an asymptotically Poisson distribution as the number of balls grows to infinity. Our aim here is to systematically study the asymptotics of the overflow in general situation, i.~e. for arbitrary $r$. In particular, we provide sufficient conditions for both Poissonian and normal asymptotics for general $r$, thus extending Hwang--Janson's work. Our approach relies on purely probabilistic methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.