On the asymptotic behavior of a sequence of random variables of interest in the classical occupancy problem
- 21 March 2014
- journal article
- Published by American Mathematical Society (AMS) in Theory of Probability and Mathematical Statistics
- Vol. 87, 31-40
- https://doi.org/10.1090/s0094-9000-2014-00902-3
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 Gärtner Ellis Theorem for the proof of some parts of this large deviation principle.Keywords
This publication has 10 references indexed in Scilit:
- Large Deviations For Performance AnalysisPublished by Taylor & Francis Ltd ,2019
- Po´lya Urn ModelsPublished by Taylor & Francis Ltd ,2008
- Large-Deviation Approximations for General Occupancy ModelsCombinatorics, Probability and Computing, 2008
- Large Deviations Principle for Occupancy Problems with Colored BallsJournal of Applied Probability, 2007
- Refined Large Deviation Asymptotics for the Classical Occupancy ProblemMethodology and Computing in Applied Probability, 2006
- Probability and ComputingPublished by Cambridge University Press (CUP) ,2005
- Large deviation asymptotics for occupancy problemsThe Annals of Probability, 2004
- Large Deviations Techniques and ApplicationsPublished by Springer Science and Business Media LLC ,1998
- A Weak Convergence Approach to the Theory of Large DeviationsWiley Series in Probability and Statistics, 1997
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995