The coupon-collector's problem revisited-Reference-Cited by-同舟云学术

The coupon-collector's problem revisited

Published:2003-06 Issue:2 Volume:40 Page:513-518
ISSN:0021-9002
Container-title:Journal of Applied Probability
language:en
Short-container-title:Journal of Applied Probability

Author:

Adler Ilan,Oren Shmuel,Ross Sheldon M.

Abstract

Consider the classical coupon-collector's problem in which items of m distinct types arrive in sequence. An arriving item is installed in system i ≥ 1 if i is the smallest index such that system i does not contain an item of the arrival's type. We study the expected number of items in system j at the moment when system 1 first contains an item of each type

Publisher

Cambridge University Press (CUP)

Subject

Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability

Reference5 articles.

1. Les nombres hyperharmonique et la fratrie du collectionneur de vignettes;Foata;Sem. Lothar. Combinatoire,2001

2. [1] Foata D. , and Zeilberger D. (2002). The collector's brotherhood problem using the Newman-Shepp symbolic method. To appear in Algebra Univ.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Three Distributions in the Extended Occupancy Problem;Methodology and Computing in Applied Probability;2023-10-30

2. Detecting compromised IoT devices: Existing techniques, challenges, and a way forward;Computers & Security;2023-09

3. We-TIPS: Weak-Block-Based Transaction Inclusion Protocol with Signaling in DAG-based Blockchain;2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt);2023-08-24

4. An Examination of the Negative Occupancy Distribution and the Coupon-Collector Distribution;Methodology and Computing in Applied Probability;2022-11-02

5. Simulating a Coupon Collector;Cyber Security, Cryptology, and Machine Learning;2022