|
Poisson limit theorems in allocation schemes of distinguishable particles
F. A. Abdushukurov Institute of Computational Mathematics and Information Technologies,
Kazan Federal University,
Kremlevskaya str., 35,
420008, Kazan, Russia
Abstract:
We consider a random variable $\mu_r(n, K, N)$ being the number of cells containing $r$ particles among first $K$ cells in an equiprobable allocation scheme of at most $n$ distinguishable particles over $N$ different cells. We find conditions ensuring the convergence of these random variables to a random Poisson variable. We describe a limit distribution. These conditions are of a simplest form, when the number of particles $r$ belongs to a bounded set or as $K$ is equivalent to $\sqrt{N}$. Then random variables $\mu_r(n, K, N)$ behave as the sums of independent identically distributed indicators, namely, as binomial random variables, and our conditions coincide with the conditions of a classical Poisson limit theorem. We obtain analogues of these theorems for an equiprobable allocation scheme of $n$ distinguishable particles of $N$ different cells. The proofs of these theorems are based on the Poisson limit theorem for the sums of exchangeable indicators and on an analogue of the local limit Gnedenko theorem.
Keywords:
allocation scheme of distinguishable particles over different cells, Poisson random variable, Gaussian random variable, limit theorem, local limit theorem.
Received: 24.11.2019
Citation:
F. A. Abdushukurov, “Poisson limit theorems in allocation schemes of distinguishable particles”, Ufa Math. J., 12:3 (2020), 3–10
Linking options:
https://www.mathnet.ru/eng/ufa520https://doi.org/10.13108/2020-12-3-3 https://www.mathnet.ru/eng/ufa/v12/i3/p3
|
Statistics & downloads: |
Abstract page: | 155 | Russian version PDF: | 64 | English version PDF: | 29 | References: | 34 |
|