coupon collector problem.docVIP

虚拟实验室 有限采样模型 1 2 3 4 5 6 7 8 [9] 10 9. 9。 The Coupon Collector Problem优惠券收集问题 Preliminaries 预赛 Our random experiment is to sample repeatedly, with replacement, from the population D 1, 2, ..., N .我们的随机试验，反复品尝 ，更换，从人口 1，2，...，N ，。 This generates a sequence of independent random variables , each uniformly distributed on D :这会产生一个独立的 随机变量 ，每个D 上的均匀分布序列： X 1 , X 2 , X 3 , ... x 1，x 2，x 3，... We will often interpret the sampling in terms of a coupon collector : each time the collector buys a certain product bubble gum or Cracker Jack, for example she receives a coupon a baseball card or a toy, for example which is equally likely to be any one of N types.我们会经常采样在票面收藏家方面解释：每次收藏家购买某种产品（泡泡糖或饼干杰克例如，）她收到一张优惠券（棒球卡或玩具，例如），这同样是可能的是任何一个类型的 N。 Thus, in this setting, X i is the coupon type received on the i th purchase.因此，在此设置，X I是对我的日购买收到的优惠券类型。 Let V N , n denote the number of distinct values in the first n selections, the random variable studied in the last section. 设 V N组 ，n表示第 n选择，在最后一节研究随机变量的不同值的数量 。 Our interest is in this section is the sample size needed to get k distinct sample values:我们感兴趣的是在本节中需要得到k个不同的样本值的样本大小： W N , k min n : V N , n k , k 1, 2, ..., N . W N，K MIN N：V N，当n k ，K 1，2，...，氮。 In terms of the coupon collector, this random variable gives the number of products required to get k distinct coupon types.这个随机变量在票面收藏家，使需要得到k个不同类型的优惠券的产品数量。 Note that the possible values of W N , k are k , k + 1, k + 2, ....需要注意的是W 的N，K的可能值K，K +，K + 2，... We will be particularly interested in W N , N , the sample size needed to get the entire population.我们将在W，N，N，样本大小，需要得到整个人口特别感兴趣。 In terms of the coupon collector, this is the number of products required to get the entire set of coupons.在票面收藏家而言，这是需要得到优惠券的整套产品的数量。 1. 1。 In the coupon collector experiment , set N 50 and vary k .在优惠券收集实验 ， 设置 N 50，不同K表 。 Note the shape of and position of the density graph.注意密度图的形状和位置。 With k 20, run the experiment in single-step mode a few times and watch the outco