Three distributions in the extended occupancy problem
From MaRDI portal
Abstract: The classical and extended occupancy distributions are useful for examining the number of occupied bins in problems involving random allocation of balls to bins. We examine the extended occupancy problem by framing it as a Markov chain and deriving the spectral decomposition of the transition probability matrix. We look at three distributions of interest that arise from the problem, all involving the noncentral Stirling numbers of the second kind. These distributions give a useful generalisation to the binomial and negative-binomial distributions. We examine how these distributions relate to one another, and we derive recursive properties and mixture properties that characterise the distributions.
Recommendations
- scientific article; zbMATH DE number 1058057
- Occupancy with two types of balls
- A unified derivation of the complementary waiting time distribution in sequential occupancy
- Combinatorial Methods in Discrete Distributions
- An examination of the negative occupancy distribution and the coupon-collector distribution
Cites work
- A generalization of the classical occupancy problem
- A Note on the Classical Occupancy Problem
- Asymptotic distributions for occupancy and waiting time problems with positive probability of falling through the cells
- Combinatorial Methods in Discrete Distributions
- Estimating the Error Rate of a Prediction Rule: Improvement on Cross-Validation
- How Biased is the Apparent Error Rate of a Prediction Rule?
- scientific article; zbMATH DE number 3458034 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 3586221 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- Improvements on Cross-Validation: The .632+ Bootstrap Method
- Local limit theorems for finite and infinite urn models
- Non-central Stirling numbers and some applications
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- Stochastically monotone Markov Chains
- The bootstrap and Edgeworth expansion
- The Classical Occupancy Distribution: Computation and Approximation
- The coupon-collector's problem revisited
This page was built for publication: Three distributions in the extended occupancy problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087240)