Sampling from a Mixture of Different Groups of Coupons  

作　　者：Aristides V.DOUMAS Vassilis G.PAPANICOLAOU 

机构地区：[1]Department of Mathematics,National Technical University of Athens,Zografou Campus,15780,Athens,Greece

出　　处：《Acta Mathematica Sinica,English Series》2020年第12期1357-1383,共27页数学学报（英文版）

摘　　要：A collector samples coupons with replacement from a pool containing g uniform groups of coupons,where"uniform group"means that all coupons in the group are equally likely to occur(while coupons of different groups have different probabilities to occur).For each j=1,...,g,let Tj be the number of trials needed to detect Group j,namely to collect all Mj coupons belonging to it at least once.We first derive formulas for the probabilities P{T1<···<Tg}and P{T1=∧^gj=1Tj}.After that,without severe loss of generality,we restrict ourselves to the case g=2 and compute the asymptotics of P{T1<T2}as the number of coupons grows to infinity in a certain manner.Then,we focus on T:=T1∨T2,i.e.the number of trials needed to collect all coupons of the pool(at least once),and determine the asymptotics of E[T]and V[T],as well as the limiting distribution of T(appropriately normalized)as the number of coupons becomes large.

关 键 词：Coupon collector problems urn problems ASYMPTOTICS limiting distribution Gumbel distribution 

分 类 号：O212.2[理学—概率论与数理统计]