Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-27T22:01:19.286Z Has data issue: false hasContentIssue false
  • English
  • Français

Generalized Coupon Collection: The Superlinear Case

Part of: Combinatorial probability Combinatorics Limit theorems Stochastic processes

Published online by Cambridge University Press:  14 July 2016

R. T. Smythe
R. T. Smythe*
Affiliation:
Oregon State University
*
∗Postal address: Department of Statistics, Oregon State University, Corvallis, OR 97331-4606, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider a generalized form of the coupon collection problem in which a random number, S, of balls is drawn at each stage from an urn initially containing n white balls (coupons). Each white ball drawn is colored red and returned to the urn; red balls drawn are simply returned to the urn. The question considered is then: how many white balls (uncollected coupons) remain in the urn after the kn draws? Our analysis is asymptotic as n → ∞. We concentrate on the case when kn draws are made, where kn / n → ∞ (the superlinear case), although we sketch known results for other ranges of kn. A Gaussian limit is obtained via a martingale representation for the lower superlinear range, and a Poisson limit is derived for the upper boundary of this range via the Chen-Stein approximation.

Keywords

Urn modelmartingaleoccupancy problemcoupon collectioncentral limit theoremPoisson limit

MSC classification

Secondary: 60F05: Central limit and other weak theorems 60G42: Martingales with discrete parameter 05A05: Permutations, words, matrices 60C05: Combinatorial probability
Type
Research Article
Information
Journal of Applied Probability , Volume 48 , Issue 1 , March 2011 , pp. 189 - 199
Copyright
Copyright © Applied Probability Trust 2011 

References

Adler, I. and Ross, S. M. (2001). The coupon subset collection problem. J. Appl. Prob. 38, 737–746.Google Scholar
Arratia, R., Goldstein, L. and Gordon, L. (1990). Poisson approximation and the Chen–Stein method. Statist. Sci. 5, 403–434.Google Scholar
Békéssy, A. (1963). On classical occupancy problems. I. Magyar Tud. Akad. Mat. Kuktató Int. Közl. 8, 59–71.Google Scholar
Chistyakov, V. P. (1964). On the calculation of the power of the test of empty boxes. Theory Prob. Appl. 9, 648–653.CrossRefGoogle Scholar
Hall, P. and Heyde, C. C. (1980). Martingale Limit Theory and Its Applications. Academic Press, New York.Google Scholar
Holst, L. (1971). Limit theorems for some occupancy and sequential occupancy problems. Ann. Math. Statist. 42, 1671–1680.CrossRefGoogle Scholar
Ivchenko, G. I. (1998). How many samples does it take to see all of the balls in an urn? Math. Notes 64, 49–54.Google Scholar
Kobza, J. E., Jacobson, S. H. and Vaughan, D. E. (2007). A survey of the coupon collector's problem with random sample sizes. Methodology Comput. Appl. Prob. 9, 573–584.Google Scholar
Kolchin, V. F., Sevast'yanov, B. A. and Chistyakov, V. P. (1978). Random Allocations. Winston, Washington, DC.Google Scholar
Mahmoud, H. M. (2010). Gaussian phases in generalized coupon collection. Adv. Appl. Prob. 42, 994–1012.Google Scholar
Mikha{ı˘lov, V.} (1977). A Poisson limit theorem in the scheme of group disposal of particles. Theory Prob. Appl. 22, 152–156.CrossRefGoogle Scholar
Pólya, G. (1930). Eine Wahrscheinlichkeitsaufgabe zur Kunderwerbung. Z. Angew. Math. Mech. 10, 96–97.CrossRefGoogle Scholar
Rényi, A. (1962). Three new proofs and a generalization of a theorem of Irving Weiss. Magyar Tud. Akad. Mat. Kutató Int. Közl. 7, 203–214.Google Scholar
Rosén, B. (1969). Asymptotic normality in a coupon collector's problem. Z. Wahrscheinlichkeitsth. 13, 256–279.CrossRefGoogle Scholar
Sellke, T. (1995). How many i.i.d. samples does it take to see all the balls in a box? Ann. Appl. Prob. 5, 294–309.Google Scholar
Stadje, W. (1990). The collector's problem with group drawings. Adv. Appl. Prob. 22, 866–882.CrossRefGoogle Scholar
Weiss, I. (1958). Limiting distributions in some occupancy problems. Ann. Math. Statist. 29, 878–884.Google Scholar
Von Mises, R. (1939). Über aufteilungs- und besetzungs-Wahrscheinlichkieten. Revu de la Faculté des Sciences de l'Université d'Istanbul, Vol. 4, pp. 145–163.Google Scholar
Zubkov, A. M. and Mikha{ı˘lov, V. G.} (1974). Limit distributions of random variables associated with long duplications in a sequence of independent trials. Theory Prob. Appl. 19, 172–179.CrossRefGoogle Scholar