The maximum occupancy number in a simple urn model
From MaRDI portal
Let \(m\) balls be randomly placed into \(n\) urns. For certain sequences of \(m\) and \(n\) tending to infinity it is shown that the maximal number of balls in the same urn tends to a two-point distribution. This is shown by analysis of the moments of occupancy numbers, that is the number of urns containing a given number of balls.
Recommendations
Cites work
- A nearly degenerate random variable occurring in an occupancy problem
- A representation for multinomial cumulative distribution functions
- A unified approach to limit theorems for urn models
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- Normal approximation in an urn model with indistinguishable balls
- Some limit theorems in urn models with indistinguishable balls
Cited in
(11)- An occupancy problem
- Some limit theorems on distributional patterns of balls in urns
- On the number of overflown urns and excess balls in an allocation model with limited urn capacity
- scientific article; zbMATH DE number 3167451 (Why is no real title available?)
- scientific article; zbMATH DE number 5538152 (Why is no real title available?)
- A note on a randomized occupancy problem
- The Prisoner's Dilemma
- Extension of the urinal problem
- A short note on the average maximal number of balls in a bin
- Maximal Percentages in Pólya's Urn
- Asymptotics of the overflow in urn models
This page was built for publication: The maximum occupancy number in a simple urn model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284066)
