Limit Theorems for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles

Cited In (25)

Randomization-based test for censored outcomes: a new look at the logrank test
Poisson limit theorems in allocation schemes of distinguishable particles
Approaching the coupon collector’s problem with group drawings via Stein’s method
Limit theorems for number of particles from a fixed set of cells
Method of moments and sums of random indicators
Stochastic ordering of classical discrete distributions
On the number of empty cells in a non-homogeneous allocation scheme
Poisson limits for generalized random allocation problems
Asymptotics of multivariate contingency tables with fixed marginals
List colorings of multipartite hypergraphs
Hidden words statistics for large patterns
Gaussian phases in generalized coupon collection
Moment characteristics of a random mapping with restrictions on component sizes
Speed and concentration of the covering time for structured coupon collectors
On asymptotic expansion in the random allocation of particles by sets
Mod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functions
Polynomial-time perfect matchings in dense hypergraphs
Title not available (Why is that?)
Phases in the Diffusion of Gases via the Ehrenfest URN Modelx
The Poisson binomial distribution -- old \& new
An urn model for population mixing and the phases within
A Pólya Approximation to the Poisson-Binomial Law
Stein's method and Narayana numbers
Binomial approximation to the Poisson binomial distribution
Об асимптотической нормальности числа пустых ячеек в одной схеме размещения частиц комплектами

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321163)