Affiliation:
1. Lomonosov Moscow State University Moscow , Russia
Abstract
Abstract
A classical scheme of random equiprobable allocations of n particles into N cells is considered. We find an asymptotic formula for the probability that the number of empty cells is equal to k under the condition that n, N → ∞ in such a way that n/(N − k) is bounded and separated from 1 from below.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. Kolchin V. F., Sevastyanov B. A., Chistyakov V. P., Random Allocations, V. H. Winston & Sons, Washington, 1978, 262 pp.
2. Dupuis, P., Zhang, J., Whiting, P., “Refined large deviation asymptotics for the classical occupancy problem”, Methodol. Comput. Appl. Probab., 8 (2006), 467–496.
3. KolchinV. F., “The speed of convergence to limit distributions in the classical ball problem”, Theory Probab.Appl., 11:1 (1966), 128–140.
4. Kolchin V. F., “Uniform local limit theorem in the classical ball problem for a case with varying lattice”, Theory Probab. Appl., 12:1 (1967), 57–67.
5. Cramér H., “On a new limit theorem of the theory of probability”, Uspekhi matem. nauk, 10 (1944), 166–178 (in Russian).