Waiting time in a scheme of allocating particles to cells
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Branching processes, random walks, and related problems, Tome 282 (2013), pp. 80-86
Cet article a éte moissonné depuis 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.
@article{TM_2013_282_a6,
author = {V. P. Chistyakov},
title = {Waiting time in a~scheme of allocating particles to cells},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {80--86},
year = {2013},
volume = {282},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TM_2013_282_a6/}
}
V. P. Chistyakov. Waiting time in a scheme of allocating particles to cells. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Branching processes, random walks, and related problems, Tome 282 (2013), pp. 80-86. http://geodesic.mathdoc.fr/item/TM_2013_282_a6/
[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