Abstract

We examine the negative occupancy distribution and the coupon-collector distribution, both of which arise as distributions relating to hitting times in the extended occupancy problem. These distributions constitute a full solution to a generalised version of the coupon collector problem, by describing the behaviour of the number of items we need to collect to obtain a full collection or a partial collection of any size. We examine the properties of these distributions and show how they can be computed and approximated. We give some practical guidance on the feasibility of computing large blocks of values from the distributions, and when approximation is required.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call