Methods for Studying Generalized Birthday and Coupon Collection Problems
From MaRDI portal
Publication:3625311
DOI10.1080/03610910801943669zbMath1162.60304OpenAlexW2084100960WikidataQ123247400 ScholiaQ123247400MaRDI QIDQ3625311
Publication date: 12 May 2009
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610910801943669
Related Items
A UNIFIED APPROACH TO GENERATING FUNCTIONS BASED ON BELL POLYNOMIALS ⋮ Coupon collector's problems with statistical applications to rankings ⋮ Birth, death, coincidences and occupancies: solutions and applications of generalized birthday and occupancy problems ⋮ On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials ⋮ On discrete distributions generated from drawing balls with bivariate labels ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings
Cites Work
- Unnamed Item
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- On the number of overflown urns and excess balls in an allocation model with limited urn capacity
- The matching, birthday and the strong birthday problem: a contemporary review
- Combinatorial Methods in Discrete Distributions
- Solutions of Some Birthday Problems Using Dirichlet Integrals