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.60017OpenAlexW1966599810MaRDI 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 (22)

A Pólya Approximation to the Poisson-Binomial LawMethod of moments and sums of random indicatorsMoment characteristics of a random mapping with restrictions on component sizesAsymptotics of multivariate contingency tables with fixed marginalsAn urn model for population mixing and the phases withinMod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functionsRandomization-based test for censored outcomes: a new look at the logrank testThe Poisson binomial distribution -- old \& newApproaching the coupon collector’s problem with group drawings via Stein’s methodStein's method and Narayana numbersOn asymptotic expansion in the random allocation of particles by setsPoisson limit theorems in allocation schemes of distinguishable particlesPolynomial-time perfect matchings in dense hypergraphsОб асимптотической нормальности числа пустых ячеек в одной схеме размещения частиц комплектамиStochastic ordering of classical discrete distributionsPhases in the Diffusion of Gases via the Ehrenfest URN ModelxHidden words statistics for large patternsGaussian phases in generalized coupon collectionList colorings of multipartite hypergraphsBinomial approximation to the Poisson binomial distributionPoisson limits for generalized random allocation problemsSpeed and concentration of the covering time for structured coupon collectors




This page was built for publication: Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles