Simulating a Coupon Collector

Dina Barak-Pelleg, Daniel Berend

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The coupon collector’s problem (CCP) reads as follows: How many drawings are needed on average in order to complete a collection of n types of coupons, if at each step a single coupon is drawn uniformly randomly, independently of all the other drawings? Since CCP was first introduced, numerous questions have been posed on its basis, and it also turned out to appear in many applications, such as DDoS cyber attacks and machine learning. It is well known that, in CCP, the convergence of various quantities of interest to their asymptotic values is rather slow. Thus, simulating the process to get a feeling for their behavior is often impractical. We present here an alternative view of the process, which allows us, for equally probable coupons, to perform fast simulation for large values of the parameters.

Original languageEnglish
Title of host publicationCyber Security, Cryptology, and Machine Learning - 6th International Symposium, CSCML 2022, Proceedings
EditorsShlomi Dolev, Amnon Meisels, Jonathan Katz
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783031076886
StatePublished - 1 Jan 2022
Event6th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2022 - Beer Sheva, Israel
Duration: 30 Jun 20221 Jul 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13301 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2022
CityBeer Sheva


  • Coupon collector’s problem
  • Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Simulating a Coupon Collector'. Together they form a unique fingerprint.

Cite this