Geodesic
Waiting time in a scheme of allocating particles to cells
Informatics and Automation, Branching processes, random walks, and related problems, Tome 282 (2013), pp. 80-86 
V. P. Chistyakov. Waiting time in a scheme of allocating particles to cells. Informatics and Automation, Branching processes, random walks, and related problems, Tome 282 (2013), pp. 80-86. http://geodesic.mathdoc.fr/item/TRSPY_2013_282_a6/
@article{TRSPY_2013_282_a6,
     author = {V. P. Chistyakov},
     title = {Waiting time in a~scheme of allocating particles to cells},
     journal = {Informatics and Automation},
     pages = {80--86},
     year = {2013},
     volume = {282},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2013_282_a6/}
}
TY  - JOUR
AU  - V. P. Chistyakov
TI  - Waiting time in a scheme of allocating particles to cells
JO  - Informatics and Automation
PY  - 2013
SP  - 80
EP  - 86
VL  - 282
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2013_282_a6/
LA  - ru
ID  - TRSPY_2013_282_a6
ER  - 
%0 Journal Article
%A V. P. Chistyakov
%T Waiting time in a scheme of allocating particles to cells
%J Informatics and Automation
%D 2013
%P 80-86
%V 282
%U http://geodesic.mathdoc.fr/item/TRSPY_2013_282_a6/
%G ru
%F TRSPY_2013_282_a6

Voir la notice de l'article provenant de la source Math-Net.Ru

A modification of a scheme of allocating a random number of particles to cells is considered in which particles are allocated according to some multinomial scheme “in groups” with a random number of particles in each. The asymptotic properties of the distribution of the number of trials (allocated “groups” of particles) needed to fill a given number of cells are investigated.

[1] Kolchin V.F., Sevastyanov B.A., Chistyakov V.P., Sluchainye razmescheniya, Nauka, M., 1976 | MR

[2] Ivchenko G.I., “Vremya ozhidaniya i svyazannye s nim kharakteristiki v polinomialnoi skheme”, Diskret. matematika, 5:3 (1993), 3–34 | MR | Zbl

[3] Ivchenko G.I., “Vremya ozhidaniya i proverka gipotez v polinomialnoi skheme”, Teoriya veroyatn. i ee primen., 19:4 (1974), 839–844

[4] Shioda S., “Some upper and lower bounds on the coupon collector problem”, J. Comput. Appl. Math., 200 (2007), 154–167 | DOI | MR | Zbl