TY - GEN
T1 - Simulating a Coupon Collector
AU - Barak-Pelleg, Dina
AU - Berend, Daniel
N1 - Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - 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.
AB - 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.
KW - Coupon collector’s problem
KW - Simulation
UR - http://www.scopus.com/inward/record.url?scp=85134152445&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-07689-3_5
DO - 10.1007/978-3-031-07689-3_5
M3 - Conference contribution
AN - SCOPUS:85134152445
SN - 9783031076886
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 66
EP - 77
BT - Cyber Security, Cryptology, and Machine Learning - 6th International Symposium, CSCML 2022, Proceedings
A2 - Dolev, Shlomi
A2 - Meisels, Amnon
A2 - Katz, Jonathan
PB - Springer Science and Business Media Deutschland GmbH
T2 - 6th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2022
Y2 - 30 June 2022 through 1 July 2022
ER -