The Coupon Collector's Problem Revisited: Asymptotics of the Variance

DOI10.1239/aap/1331216649zbMath1260.60035OpenAlexW2074330916MaRDI QIDQ2879912

Aristides V. Doumas, Vassilis G. Papanicolaou

Publication date: 10 April 2012

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1331216649

zbMATH Keywords

Gumbel distributionlimit distributionhigher asymptotics

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items

The Siblings of the Coupon Collector ⋮ New Results on a Generalized Coupon Collector Problem Using Markov Chains ⋮ The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp ⋮ The number of K-tons in the coupon collector problem ⋮ A model for the spreading of fake news ⋮ An examination of the negative occupancy distribution and the coupon-collector distribution ⋮ The logarithmic Zipf law in a general urn problem ⋮ New representation theorems for completely monotone and Bernstein functions with convexity properties on their measures ⋮ Sampling from a mixture of different groups of coupons ⋮ The shape of the Borwein-Affleck-Girgensohn function generated by completely monotone and Bernstein functions ⋮ The Maximum of Independent Geometric Random Variables as the Time for Genomic Evolution ⋮ Uniform versus Zipf distribution in a mixing collection process ⋮ Minimum variance in the coupon collector's problem ⋮ Computing absorbing times via fluid approximations ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random processes of the form \(X_{n+1}=a_ n X_ n+b_ n\pmod p\)
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• General asymptotic estimates for the coupon collector problem
• On the asymptotic behaviour of the number of trials necessary to complete a set with random selection
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• The Generalised Coupon Collector Problem
• Rates of Poisson convergence for some coverage and urn problems using coupling