On the coupon-collector's problem with several parallel collections
classification
🧮 math.PR
keywords
collectionscouponsparallelarrivescasecompletecoupon-collectorequal
read the original abstract
In this note we evaluate the expectation and variance of the waiting time to complete $m$ parallel collections of coupons, in the case of coupons which arrives independently, one by one and with equal probabilities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.