We study the siblings version of the coupon collector problem. A main collector stops when every coupon type has appeared at least once, duplicates are passed successively to later siblings, and denotes the number of empty spaces in collector ’s album at the main completion time. We prove three results. First, for every fixed and , is uniquely maximized over positive coupon distributions by the uniform distribution; in fact it decreases strictly along every nonconstant ray from the uniform vector. Second, in the uniform model, is stochastically increasing in , and we construct an increasing coupling using top spacings of exponential order statistics. Third, for fixed album indices , the naturally normalized vector converges jointly to , where is exponential with mean one. We also derive exact Poissonized and alternating-subset formulae and give a transfer principle for leading expectation asymptotics.

生成讲解博客的中文版本

生成AI智能校验的中文版本