Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles
From MaRDI portal
Publication:3321163
DOI10.1137/1127084zbMath0536.60017MaRDI QIDQ3321163
Vladimir G. Mikhailov, Vladimir A. Vatutin
Publication date: 1982
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1127084
Related Items
Phases in the Diffusion of Gases via the Ehrenfest URN Modelx, Speed and concentration of the covering time for structured coupon collectors, Poisson limit theorems in allocation schemes of distinguishable particles, Об асимптотической нормальности числа пустых ячеек в одной схеме размещения частиц комплектами, List colorings of multipartite hypergraphs, Mod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functions, An urn model for population mixing and the phases within, Polynomial-time perfect matchings in dense hypergraphs, Binomial approximation to the Poisson binomial distribution, Asymptotics of multivariate contingency tables with fixed marginals, Poisson limits for generalized random allocation problems, On asymptotic expansion in the random allocation of particles by sets, Hidden words statistics for large patterns, Method of moments and sums of random indicators, Moment characteristics of a random mapping with restrictions on component sizes, Stein's method and Narayana numbers, Randomization-based test for censored outcomes: a new look at the logrank test, The Poisson binomial distribution -- old \& new, Gaussian phases in generalized coupon collection, A Pólya Approximation to the Poisson-Binomial Law, Stochastic ordering of classical discrete distributions