On a Generalisation of the coupon collector problem
Seminar talk
| Speaker |
Seminar talk
|
|---|---|
| When |
May 31, 2024
from 10:00 AM to 11:00 AM |
| Where | LH-006, Ground Floor |
| Add event to calendar |
vCal
iCal
|
Speaker: Satyaki Mukherjee (NUS)
Abstract: The original coupon collector problem asks the following question : On average how long does it take to get one instance of every coupon from a set of n coupons if you draw one coupon at a time? The traditional analysis of this however fails if the draws have even a minor dependency in between. For instance here is a natural question. What if in each turn we get r distinct coupons instead of only 1? We consider such problems by solving a further generalisation of that question.
We will also look at some conjectures and possible implications in this direction.