Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the coupon-collector's problem with several parallel collections

Published 14 Sep 2016 in math.PR | (1609.04174v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up