Abstract
AbstractWe study the infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labeled 1,2,... so that the urn j at every draw gets a ball with probability $$p_j$$
p
j
, where $$\sum _j p_j=1$$
∑
j
p
j
=
1
. We prove functional central limit theorems for discrete time and the Poissonized version for the urn occupancies process, for the odd occupancy and for the missing mass processes extending the known non-functional central limit theorems.
Funder
Russian Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference15 articles.
1. Adler, R.J.: An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes. Institute of Math. Stat, Hayward, California (1990)
2. Barbour, A.D., Gnedin, A.V.: Small counts in the infinite occupancy scheme. Electron. J. Probab. 14(13), 365–384 (2009)
3. Ben-Hamou, A., Boucheron, S., Ohannessian, M.I.: Concentration inequalities in the infinite urn scheme for occupancy counts and the missing mass, with applications. Bernoulli 23(1), 249–287 (2017)
4. Billingsley, P.: Convergence of Probability Measures, 2nd edition. Wiley, London (1999)
5. Borovkov, A.A.: Probability Theory. Universitext (2013)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献