New easy to compute formulas for the moments of random variables appearing in the coupon collector problem

DOI10.37190/0208-4147.00130MaRDI QIDQ6546054zbMATH OpenFDO

Authors Amayrani León-García, Aroldo Pérez, Addy Bolivar-Cime

Publication date 29 May 2024

Published in Probability and Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37190/0208-4147.00130

zbMATH Keywords

combinatorial probabilitycoupon collector problemmoment generating functionmoments

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Combinatorial probability (60C05)

Recommendations

• scientific article; zbMATH DE number 6297849
• Asymptotics of the rising moments for the coupon collector's problem
• COUPON COLLECTING
• A generalized coupon collector problem
• The coupon collector's problem revisited: asymptotics of the variance

Cites work

• A survey of the coupon collector's problem with random sample sizes
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Close encounters with the Stirling numbers of the second kind
• Coupon Collecting for Uneqal Probabilities
• Coupon collector's problems with statistical applications to rankings
• Euler's formula nth Differences of Powers
• New results on a generalized coupon collector problem using Markov chains
• Optimization results for a generalized coupon collector problem
• The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• The Double Dixie Cup Problem

This page was built for publication: New easy to compute formulas for the moments of random variables appearing in the coupon collector problem

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