Abstract
In a generalized allocation scheme of n particles over N cells we consider the random variable ηn,N(K) which is the number of particles in a given set consisting of K cells. We prove that if n, K, N → ∞, then under some conditions random variables ηn,N(K) are asymptotically normal, and under another conditions ηn,N(K) converge in distribution to a Poisson random variable. For the case when N → ∞ and n is a fixed number, we find conditions under which ηn,N(K) converge in distribution to a binomial random variable with parameters n and s =
Originally published in Diskretnaya Matematika (2022) 34, №3, 141–152 (in Russian).
References
[1] Kolchin V. F., “A class of limit theorems for conditional distributions”, Lietuvos math. rink., 8 (1968), 53–63 (in Russian).Search in Google Scholar
[2] Kolchin V. F., Random Graphs, Cambridge University Press, 1998,268 pp.Search in Google Scholar
[3] Kolchin V. F., Sevastyanov B. A., Chistyakov V. P., Random Allocations, V. H. Winston & Sons, Washington, 1978,262 pp.Search in Google Scholar
[4] Ivchenko G. I., Medvedev Yu. I., Discrete distributions. Probabilistic-statistical handbook. Univariate distributions, URSS, Moscow, 2015 (in Russian), 2256 pp.Search in Google Scholar
[5] Kolchin A. V., “On limit theorems for the generalised allocation scheme”, Discrete Math. Appl., 13:6 (2003), 627–636.Search in Google Scholar
[6] Chuprunov, A. N., Fazekas I., “Poisson limit theorems for the generalized allocation scheme”, Ann. Univ. Sci. Budapest, Sect. Comp., 49 (2019), 77–96.Search in Google Scholar
[7] Trunov A. N., “Limit theorems in the problem of distributing identical particles in different cells”, Proc. Steklov Inst. Math., 177 (1988), 157–175.Search in Google Scholar
[8] Chuprunov, A. N., Fazekas I., “On the number of empty cells in the allocation scheme of indistinguishable particles”, Ann. univ. Mariae Curie-Sklodowska, LXXXIV:1 (2020), 15–29.Search in Google Scholar
[9] Timashev A. N., Asymptotic expansions in probabilistic combinatorics, Nauchnoe izd-vo TVP, Moscow, 2011 (in Russian), 312pp.Search in Google Scholar
© 2023 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space
- On a number of particles in a marked set of cells in a general allocation scheme
- On the equality problem of finitely generated classes of exponentially-polynomial functions
- Fault-tolerant resolvability of some graphs of convex polytopes
- On bases of all closed classes of Boolean vector functions
- 10.1515/dma-2023-0018
Articles in the same Issue
- Frontmatter
- On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space
- On a number of particles in a marked set of cells in a general allocation scheme
- On the equality problem of finitely generated classes of exponentially-polynomial functions
- Fault-tolerant resolvability of some graphs of convex polytopes
- On bases of all closed classes of Boolean vector functions
- 10.1515/dma-2023-0018