The coupon-collector's problem revisited

被引：23

作者：

Adler, I ^{[1
]}

Oren, S ^{[1
]}

Ross, SM ^{[1
]}

机构：

[1] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA

来源：

JOURNAL OF APPLIED PROBABILITY | 2003年 / 40卷 / 02期

关键词：

coupon-collector's problem; hyperharmonic numbers; Poissonization;

D O I：

10.1239/jap/1053003560

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

Consider the classical coupon-col lector's problem in which items of m distinct types arrive in sequence. An arriving item is installed in system i greater than or equal to 1 if i is the smallest index such that system i does not contain an item of the arrival's type. We study the expected number of items in system j at the moment when system I first contains an item of each type.

引用

页码：513 / 518

页数：6