The coupon-collector's and sampling tagging problems are considered, under the model that each tagged element is $\gamma > 0$ times as likely to be caught at the next stage as every untagged element.
Advances in Applied Probability, Vol. 44, No. 2 (JUNE 2012), pp. 429-451 (23 pages) The 'coupon collection problem' refers to a class of occupancy problems in which j identical items are distributed, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results