Coupon collector’s problem and its extensions in extreme value framework

摘要

Let $mathbb{N}_n = { 1, 2, dots , n }$.We sample with replacement from the set $mathbb{N}_n$, assuming that each element has the same probability of being drawn. We determine the limiting distributions and some related properties of the waiting time $M_n$ until all triples $j j j , j in mathbb{N}_n$ are sampled.