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

Cited in

(25)

Approaching the coupon collector’s problem with group drawings via Stein’s method
Binomial approximation to the Poisson binomial distribution
Gaussian phases in generalized coupon collection
Method of moments and sums of random indicators
List colorings of multipartite hypergraphs
Limit theorems for number of particles from a fixed set of cells
The Poisson binomial distribution -- old \& new
Moment characteristics of a random mapping with restrictions on component sizes
A Pólya approximation to the Poisson-binomial law
Stein's method and Narayana numbers
Hidden words statistics for large patterns
Poisson limits for generalized random allocation problems
Stochastic ordering of classical discrete distributions
On the number of empty cells in a non-homogeneous allocation scheme
An urn model for population mixing and the phases within
Randomization-based test for censored outcomes: a new look at the logrank test
scientific article; zbMATH DE number 3856103 (Why is no real title available?)
On the asymptotic normality in a scheme of allocation of non-equiprobable particle sets
Speed and concentration of the covering time for structured coupon collectors
Poisson limit theorems in allocation schemes of distinguishable particles
Phases in the diffusion of gases via the Ehrenfest urn model
On asymptotic expansion in the random allocation of particles by sets
Asymptotics of multivariate contingency tables with fixed marginals
Polynomial-time perfect matchings in dense hypergraphs
Mod-\( \phi\) convergence of Stirling distributions and limit theorems for zeros of their generating functions

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)