×

Asymptotics of powers of binomial and multinomial probabilities. (English) Zbl 1382.60047

Summary: Fix positive integers \(k \geq 2\), \(j \geq 2\) and numbers \(p_1, p_2, \ldots, p_k\) such that \(0 < p_i < 1\) for all \(i = 1, 2, \ldots, k\), and \(\sum_{i = 1}^k p_i = 1\). For a positive integer \(n\), let \[ b_{n, j, k}(p_1, p_2, \ldots, p_k) \equiv \sum_{(n_1, n_2, \ldots, n_k) \in T_{n, k}}(\frac{n!}{n_1! n_2! \cdots n_k!} p_1^{n_1} p_2^{n_2} \cdots p_k^{n_k})^j, \] where \(T_{n, k}\) is the set \(\{(n_1, n_2, \ldots, n_k) : n_i \in \{0, 1, 2, \ldots, n \}, \sum_{i = 1}^k n_i = n \}\). Then there exists \(0 < b_{j, k}(p_1, p_2, \ldots, p_k) < \infty\) such that \[ n^{(j - 1)(k - 1) / 2} b_{n, j, k}(p_1, p_2, \ldots, p_k) \to b_{j, k}(p_1, p_2, \ldots, p_k)\,\,\,\,\,\,\, (1) \] as \(n \to \infty\).

MSC:

60F05 Central limit and other weak theorems
Full Text: DOI

References:

[1] Davis, Burgess; McDonald, David, An elementary proof of the local central limit theorem, J. Theoret. Probab., 8, 3, 693-701 (1995) · Zbl 0841.60013
[2] Farmer, Jeff D.; Leth, Steven C., An asymptotic formula for powers of binomial coefficients, Math. Gaz., 89, 516, 385-391 (2005)
[3] Feller, William, An Introduction to Probability Theory and Its Applications (1968), Wiley: Wiley New York · Zbl 0077.12201
[4] P��lya, George; Szegő, Gabor, Problems and Theorems in Analysis I (1970), Springer: Springer Berlin · Zbl 1053.00002
[5] Seber, George A. F., A Matrix Handbook For Statisticians (2008), Wiley: Wiley Hoboken, New Jersey · Zbl 1143.15001
[6] Spitzer, Frank, Principles of Random Walk (2000), Springer: Springer New York · Zbl 0979.60002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.