General asymptotic estimates for the coupon collector problem (Q1919429): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4101884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Distributions for the Coupon Collector's Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strange Series and High Precision Fraud / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behaviour of the number of trials necessary to complete a set with random selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial extreme value distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birthday paradox, coupon collectors, caching algorithms and self- organizing search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Birthday, Collectors', Occupancy and Other Classical Urn Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for some sequential occupancy problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Double Dixie Cup Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340161 / rank
 
Normal rank

Latest revision as of 12:36, 24 May 2024

scientific article
Language Label Description Also known as
English
General asymptotic estimates for the coupon collector problem
scientific article

    Statements

    General asymptotic estimates for the coupon collector problem (English)
    0 references
    0 references
    23 July 1996
    0 references
    Suppose that there are \(N\) objects, which are sampled with replacement with arbitrary drawing probabilities. Consider the expected number of trials when all the different objects have been sampled. Using an explicit formula for this number its asymptotics is studied in different cases when \(N\) tends to infinity.
    0 references
    0 references
    coupon collector problem
    0 references
    sampling with replacement
    0 references
    mean waiting time
    0 references
    asymptotics
    0 references

    Identifiers