Functional central limit theorems for occupancies and missing mass process in infinite urn models
Preprint
Abstract
We study the infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labelled 1,2,... so that the urn $j$ at every draw gets a ball with probability $p_j$, $\sum_j p_j=1$. We prove functional central limit theorems for discrete time and the poissonised version for the urn occupancies process, for the odd-occupancy and for the missing mass processes extending the known non-functional central limit theorems.
Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applicationsBernoulli, 2017
- Functional central limit theorems for certain statistics in an infinite urn schemeStatistics & Probability Letters, 2016
- Bit flipping and time to recoverJournal of Applied Probability, 2016
- From infinite urn schemes to decompositions of self-similar Gaussian processesElectronic Journal of Probability, 2016
- Notes on the occupancy problem with infinitely many boxes: general asymptotics and power lawsProbability Surveys, 2007
- Universal Compression of Memoryless Sources Over Unknown AlphabetsIEEE Transactions on Information Theory, 2004
- An introduction to continuity, extrema, and related topics for general Gaussian processes1990
- Central Limit Theorems for Infinite Urn ModelsThe Annals of Probability, 1989
- On the subspaces ofL p (p>2) spanned by sequences of independent random variablesIsrael Journal of Mathematics, 1970
- The Number of New Species, and the Increase in Population Coverage, when a Sample is IncreasedBiometrika, 1956