Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-05T05:11:27.082Z Has data issue: false hasContentIssue false

The Number of Collisions for the Occupancy Problem with Unequal Probabilities

Published online by Cambridge University Press:  22 February 2016

Toshio Nakata*
Affiliation:
Fukuoka University of Education
*
Postal address: Department of Mathematics, Fukuoka University of Education, Akama-Bunkyomachi, Munakata, Fukuoka, 811-4192, Japan. 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.

In this article we study a number of collisions concerning a simple occupancy problem with unequal probabilities. Using combinatorial arguments and negative associations of random variables, we have several limit theorems, namely, a weak law of large numbers and a Poisson law of small numbers including the Chen-Stein estimate.

Type
Research Article
Copyright
© Applied Probability Trust 

Footnotes

Dedicated to Professor Masafumi Yamashita on the occasion of his 60th birthday.

References

Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation (Oxford Studies Prob. 2). Oxford University Press.CrossRefGoogle Scholar
Bodini, O., Gardy, D. and Roussel, O. (2012). Boys-and-girls birthdays and Hadamard products. Fund. Inform. 117, 85104.Google Scholar
Boucheron, S. and Gardy, D. (1997). An urn model from learning theory. Random Structures Algorithms 10, 4367.3.0.CO;2-X>CrossRefGoogle Scholar
Borcea, J., Brändén, P. and Liggett, T. M. (2009). Negative dependence and the geometry of polynomials. J. Amer. Math. Soc. 22, 521567.CrossRefGoogle Scholar
Dubhashi, D. and Panconesi, A. (2009). Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press.Google Scholar
Durrett, R. (1996). Probability: Theory and Examples, 2nd edn. Duxbury Press, Belmont, CA.Google Scholar
Johnson, N. L. and Kotz, S. (1977). Urn Models and Their Application. John Wiley, New York.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.Google Scholar
Flajolet, P. and Sedgewick, R. (2009). Analytic Combinatorics. Cambridge University Press.CrossRefGoogle Scholar
Gnedin, A., Hansen, B. and Pitman, J. (2007). Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws. Prob. Surveys 4, 146171.Google Scholar
Joag-Dev, K. and Proschan, F. (1983). Negative association of random variables, with applications. Ann. Statist. 11, 286295.Google Scholar
Kolchin, V. F., Sevast'yanov, B. A. and Chistyakov, V. P. (1978). Random Allocations. V. H. Winston, Washington, DC.Google Scholar
Nakata, T. (2008). A Poisson approximation for an occupancy problem with collisions. J. Appl. Prob. 45, 430439.Google Scholar
Nakata, T. (2008). Collision probability for an occupancy problem. Statist. Prob. Lett. 78, 19291929.Google Scholar
Nishimura, K. and Sibuya, M. (1988). Occupancy with two types of balls. Ann. Inst. Statist. Math. 40, 7791.CrossRefGoogle Scholar
Pemantle, R. (2000). Towards a theory of negative dependence. J. Math. Phys. 41, 13711390.CrossRefGoogle Scholar
Popova, T. Yu. (1968). Limit theorems in a model of distribution of particles of two types. Theory Prob. Appl. 13, 511516.CrossRefGoogle Scholar
Resnick, S. I. (1987). Extreme Values, Regular Variation, and Point Processes. Springer, New York.Google Scholar
Selivanov, B. I. (1995). On the waiting time in a scheme for the random allocation of colored particles. Discrete Math. Appl. 5, 7382.Google Scholar
Wendl, M. C. (2003). Collision probability between sets of random variables. Statist. Prob. Lett. 64, 249254.Google Scholar
Wendl, M. C. (2005). Probabilistic assessment of clone overlaps in DNA fingerprint mapping via a priori models. J. Comput. Biol. 12, 283297.Google Scholar