Refined Large Deviation Asymptotics for the Classical Occupancy Problem
- 71 Downloads
In this paper refined large deviation asymptotics are derived for the classical occupancy problem. The asymptotics are established for a sequential filling experiment and an occupancy experiment. In the first case the random variable of interest is the number of balls required to fill a given fraction of the urns, while in the second a fixed number of balls are thrown and the random variable is the fraction of nonempty urns.
KeywordsRefined large deviation asymptotics Occupancy process Large deviation principle Central Limit Theorem
AMS 2000 Subject Classification60F10 60K30 60G50
Unable to display preview. Download preview PDF.
- C. Budianu and L. Tong, “Good–Turing estimation of the number of operating sensors: a large deviations analysis,” In Proceedings of the ICASSP, Montreal, Canada vol. 2 pp. 1029–1032, 2004.Google Scholar
- C. Nuzman and P. Whiting, “Optical switch dimensioning and the classical occupancy problem,” International Journal of Telecommunication Systems vol. 15 pp. 127–141, 2001.Google Scholar
- C. Nuzman, P. Whiting, and X. Zhang, “Importance sampling of an optical switch,” In Proceedings 40th Allerton Conference on Communications, Computing and Control, Allerton House, Monitcello, September 2002.Google Scholar
- J. X. Zhang, On large deviations approximations for occupancy problems. PhD thesis, Brown University, 2005.Google Scholar