Asymptotics for the random coupon collector problem (Q1298487): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3207312 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: General asymptotic estimates for the coupon collector problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5512461 / 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: Redundancy in mathematical programming. A state-of-the-art survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global optimization / rank | |||
Normal rank |
Latest revision as of 20:43, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotics for the random coupon collector problem |
scientific article |
Statements
Asymptotics for the random coupon collector problem (English)
0 references
13 December 1999
0 references
Suppose that \(N\) objects are sampled independently with replacement until all objects have been seen. Let this happen at trial \(T\). To each object there is a drawing probability; these probabilities are proportional to iid observations of a positive random variable with Laplace transform \(g(t)\). The mean \(E(T)\) is expressed in \(g(t)\). Using this the asymptotics of \(E(T)\) is studied when \(N\) tends to infinity. The asymptotics is typically determined by the behaviour of \(g(t)\) for large \(t\) or equivalently by the distribution function close to 0.
0 references
random coupon collector problem
0 references
Laplace integral
0 references