Omnibus sequences, coupon collection, and missing word counts

DOI10.1007/s11009-011-9247-6zbMath1278.60016arXiv0905.4517OpenAlexW2084356989MaRDI QIDQ352894

Sunil Abraham, Stephanie Sapp, Greg Brockman, Anant P. Godbole

Publication date: 5 July 2013

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.4517

zbMATH Keywords

asymptotic behaviorextreme value distributioncoupon collection

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial probability (60C05)

Related Items

Waiting time distribution for the emergence of superpatterns ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Preferential arrangement superpatterns ⋮ Some results on superpatterns for preferential arrangements ⋮ Limit theorem for the Robin Hood game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coupon collecting with quotas
• Probability approximations via the Poisson clumping heuristic
• The collector's brotherhood problem using the Newman-Shepp symbolic method
• The coupon subset collection problem
• Some bounds on the coupon collector problem
• The Double Dixie Cup Problem
• Exact distribution of the linear combination ofpGumbel random variables
• The Generalised Coupon Collector Problem
• On Birthday, Collectors', Occupancy and Other Classical Urn Problems
• Some applications of the Stein-Chen method for proving Poisson convergence
• The coupon-collector's problem revisited
• Some New Aspects of the Coupon Collector's Problem
• Coupon Collecting for Uneqal Probabilities
• The hyperharmonic numbers and the phratry of the coupon collector