Some upper and lower bounds on the coupon collector problem

DOI10.1016/j.cam.2005.12.011zbMath1113.60022OpenAlexW2097462212MaRDI QIDQ859873

Shigeo Shioda

Publication date: 22 January 2007

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.12.011

zbMATH Keywords

Schur-convex functionIP tracebackdenial of service attackprobabilistic-packet-marking

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Communication networks in operations research (90B18) Combinatorial probability (60C05)

Related Items

Statistical Model Checking for Variability-Intensive Systems ⋮ Waiting time in a scheme of allocating particles to cells ⋮ Coupon subset collection problem with quotas ⋮ Statistical model checking for variability-intensive systems: applications to bug detection and minimization

Cites Work

• Unnamed Item
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Asymptotics for the random coupon collector problem
• Extreme value distributions for random coupon collector and birthday problems
• General asymptotic estimates for the coupon collector problem
• Some bounds on the coupon collector problem
• Inequalities: theory of majorization and its applications