2000 character limit reached
A note on the coupon - collector's problem with multiple arrivals and the random sampling
Published 12 Sep 2012 in math.PR | (1209.2667v2)
Abstract: In this note we evaluate the expected waiting time to complete a collection of coupons, in the case of coupons which arrives in groups of constant size, independently and with unequal probabilities. As an application we will be able to determine the expected number of samples of dimension g that we have to draw independently in order to observe all the types of individuals in a given population.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.