Omnibus Sequences, Coupon Collection, and Missing Word Counts-Reference-Cited by-同舟云学术

Omnibus Sequences, Coupon Collection, and Missing Word Counts

Published:2011-08-27 Issue:2 Volume:15 Page:363-378
ISSN:1387-5841
Container-title:Methodology and Computing in Applied Probability
language:en
Short-container-title:Methodol Comput Appl Probab

Author:

Abraham Sunil,Brockman Greg,Sapp Stephanie,Godbole Anant P.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/s11009-011-9247-6.pdf

Reference24 articles.

1. Adler I, Ross S (2001) The coupon subset collection problem. J Appl Probab 38:737–746

2. Adler I, Oren S, Ross S (2003) The coupon collector’s problem revisited. J Appl Probab 40:513–518

3. Aldous D (1989) Probability approximations via the poisson clumping heuristic. Springer, New York

4. Badus A, Godbole A, LeDell E, Lents N (2003) Some contributions to the coupon collector problem. In: Extended abstract, 2003 permutation patterns conference, Dunedin, New Zealand. Manuscript in preparation

5. Barbour A, Holst L (1989) Some applications of the Stein–Chen method for proving Poisson convergence. Adv Appl Probab 21:74–90

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

1. Limit theorem for the Robin Hood game;Statistics & Probability Letters;2019-06

2. New limit results related to the coupon collector’s problem;Studia Scientiarum Mathematicarum Hungarica;2018-03

3. Some results on superpatterns for preferential arrangements;Advances in Applied Mathematics;2016-10

4. Preferential Arrangement Superpatterns;Electronic Notes in Discrete Mathematics;2016-10

5. Universal Cycle Packings and Coverings for k-Subsets of an n-Set;Graphs and Combinatorics;2016-07-21