On the asymptotic behavior of a sequence of random variables of interest in the classical occupancy problem

Abstract

In the classical occupancy problem one puts balls in boxes, and each ball is independently assigned to any fixed box with probability . It is well known that, if we consider the random number of balls required to have all the boxes filled with at least one ball, the sequence converges to 1 in probability. Here we present the large deviation principle associated to this convergence. We also discuss the use of the Gartner Ellis Theorem for the proof of some parts of this large deviation principle