On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme
-
Boris I. Selivanov
and
Vladimir P. Chistyakov
Abstract
We consider random polynomial allocations of particles over N cells. Let τk, k ≥ 1, be the minimal number of trials when k particles hit the occupied cells. For the case N → ∞ the limit distribution of the random variable
Note: Originally published in Diskretnaya Matematika (2019) 31,№2, 143–151 (in Russian).
Funding statement: Research was supported by RAS Program «Modern problems of theoretical mathematics».
References
[1] Feller W., An introduction to probability theory and its applications 1, 2nd ed., Wiley, New York, 1957, 461 pp.Search in Google Scholar
[2] Kolchin V. F., Sevastyanov B. A., Chistyakov V. P., Random allocations V. H. Winston & Sons, Washington, 1978, 262 pp.Search in Google Scholar
[3] Ivchenko G. I., “The waiting time and related statistics in the multinomial scheme: a survey”, Discrete Math. Appl. 3:5 (1993), 451–482.10.1515/dma.1993.3.5.451Search in Google Scholar
[4] Selivanov B. I., “On waiting time in the scheme of random allocation of coloured particies”, Discrete Math. Appl. 5:1 (1995), 73–82.10.1515/dma.1995.5.1.73Search in Google Scholar
[5] Dwass M., “More birthday surprises”, J. of Combin. Theory 7 (1969), 258–261.10.1016/S0021-9800(69)80019-0Search in Google Scholar
[6] James B., James K., Qi Y.-C., “Limit theorems for correlated Bernoulli random variables”, Statist. Probab. Letters 78:15 (2008), 2339–2345.10.1016/j.spl.2008.01.104Search in Google Scholar
[7] Dwight H. B., Tables of Integrals and Other Mathematical Data 3rd Ed., The Macmillan Co: New York and London, 1957, 288 pp.Search in Google Scholar
© 2020 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Group polynomials over rings
- Maximum subclasses in classes of linear automata over finite fields
- Using binary operations to construct a transitive set of block transformations
- Perfect matchings and K1,p-restricted graphs
- On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme
- Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation
Articles in the same Issue
- Frontmatter
- Group polynomials over rings
- Maximum subclasses in classes of linear automata over finite fields
- Using binary operations to construct a transitive set of block transformations
- Perfect matchings and K1,p-restricted graphs
- On the waiting times to repeated hits of cells by particles for the polynomial allocation scheme
- Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation
