Asymptotics of conditional probabilities of succesful allocation of random number of particles into cells

A. I. Afonina ; I. R. Kayumov ; A. N. Chuprunov

Diskretnaya Matematika, Tome 28 (2016) no. 3, pp. 14-25.

Résumé

The article is devoted to the memory of Valentin Fedorovich Kolchin.\qquad\qquad\qquad\qquad\qquad\linebreak Let $\zeta$, $\zeta_i$ ($i\inN$) be independent identically distributed nonnegative integer-valued random variables, $(\eta_{i1},\dots, \eta_{iN})$ be the fillings of cells in the generalized scheme of allocation of $\zeta_i$ particles into $N$ cells, $1\le i\le n$, for fixed $Z_n=(\zeta_1,\ldots,\zeta_n)$ these allocation schemes are independent. We consider the conditional probabilities $P(A_{n, N}\,|\,Z_n)$ of the event\linebreak $A_{n, N}=\{\text{each cell in each of } n \text{ allocation schemes contains no more than } r \text{ particles}\}$, where $r$ is some fixed number. The sufficient conditions for the convergence of the sequence $P(A_{n, N}\,|\,Z_n)$ to a nonrandom limit with probability 1 are given. It is shown that the random variable $\ln P(A_{n, N}\,|\,Z_n)$ is asymptotically normal. Applications of the obtained results to the noise-proof encoding are discussed.

Détail

Keywords: generalized allocation scheme, Cauchy integral, Hamming code.

Bibliographie

[1] Kolchin V. F., “Odin klass predelnykh teorem dlya uslovnykh raspredelenii”, Lit. matem. sb., 8:1 (1968), 53–63 | MR | Zbl

[2] Kolchin V. F., Random Graphs, Cambridge University Press, 1999, 252 pp. | MR | Zbl

[3] Timashev A. N., Asimptoticheskie razlozheniya v veroyatnostnoi kombinatorike, Nauchn. izd-vo TVP, M., 2011, 312 pp.

[4] Timashev A. N., Obobschennaya skhema razmescheniya v zadachakh veroyatnostnoi kombinatoriki, Izd. dom “Akademiya”, M., 2011, 268 pp.

[5] Timashev A. N., Bolshie ukloneniya v veroyatnostnoi kombinatorike, Izd. dom “Akademiya”, M., 2011, 248 pp.

[6] Pavlov Yu. L., Random Forests, VSP, Utrecht, 2000 | MR

[7] Kolchin A. V., “On limit theorems for the generalised allocation scheme”, Discrete Math. Appl., 13:6 (2003), 627–636 | DOI | DOI | MR | Zbl

[8] Kolchin A. V., Kolchin V. F., “On transition of distributions of sums of independent identically distributed random variables from one lattice to another in the generalised allocation scheme”, Discrete Math. Appl., 16:6 (2006), 527–540 | DOI | DOI | MR | Zbl

[9] Kolchin A. V., Kolchin V. F., “On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another”, Discrete Math. Appl., 17:5 (2007), 455–461 | DOI | DOI | MR | Zbl

[10] Novikov F. A., Diskretnaya matematika dlya programmistov, Piter, 2004

[11] Avkhadiev F. G., Chuprunov A. N., “The probability of a successful allocation of ball groups by boxes”, Lobachevskii J. Math., 25 (2007), 3–7 | MR | Zbl

[12] Avkhadiev F. G., Kayumov I. R., Chuprunov A. N., “Issledovanie veroyatnosti uspeshnogo razmescheniya chastits po yacheikam metodami kompleksnogo analiza”, Trudy Matem. Tsentra im. N. I. Lobachevskogo, 19, Kazan, 2003, 6–7

[13] Kayumov I. R., Chuprunov A. N., “The probability of successful allocation of particles in cells (the general case)”, J. Math. Sci., 209:1 (2015), 88–95 | DOI | MR | Zbl

[14] Chuprunov A. N., Khamdeev B. I., “O veroyatnosti ispravleniya oshibok pri pomekhoustoichivom kodirovanii, kogda chislo oshibok prinadlezhit nekotoromu konechnomu mnozhestvu”, Inform. i ee primen., 3:3, Veroyatnostno-statisticheskie metody i zadachi informatiki i informatsionnykh tekhnologii (2009), 52–59

[15] Chuprunov A. N., Khamdeev B. ., “The probability of correcting errors by an antinoise coding method when the number of errors belongs to a random set”, Russian Math. (Iz. VUZ), 54:8 (2010), 67–73 | DOI | MR | Zbl

[16] Chuprunov A. N., Khamdeev B. I., “On probability of correction of a random number of errors in an error-correcting coding”, Discrete Math. Appl., 20:2 (2010), 179–190 | DOI | DOI | MR | Zbl