Abstract
In this paper, we consider an unbalanced urn model with multiple drawing. At each discrete time step n, we draw m balls at random from an urn containing white and blue balls. The replacement of the balls follows either opposite or self-reinforcement rule. Under the opposite reinforcement rule, we use the stochastic approximation algorithm to obtain a strong law of large numbers and a central limit theorem for \(W_n\): the number of white balls after n draws. Under the self-reinforcement rule, we prove that, after suitable normalization, the number of white balls \(W_n\) converges almost surely to a random variable \(W_\infty \) which has an absolutely continuous distribution.
Similar content being viewed by others
References
Athreya, K. B., Ney, P. E. (1972). Branching Processes. Berlin: Springer.
Baggchi, A., Paul, A. K. (1985). Asymptotic normality in the generalized Pólya-Eggenberger urn model with application to computer data structure. SIAM Journal on Algebraic and Discrete Methods, 6(3), 394–405.
Benveniste, A., Métivier, M., Priouret, P. (1990). Adaptive algorithms and stochastic approximations. Berlin: Springer.
Chauvin, B., Pouyanne, N., Sahnoun, R. (2011). Limit distributions for large Pólya urns. Annals of Applied Probability, 21(1), 1–32.
Chen, M. R., Kuba, M. (2013). On generalized Polya urn models. Journal of Applied Probability Theory, 50(4), 1169–1186.
Chen, M. R., Wei, C. Z. (2005). A new urn model. Journal of Applied Probability, 42(4), 964–976.
Duflo, M. (1997). Random iterative models. Berlin: Springer.
Eggenberger, F., & Polya, G. (1923). Über die Statistik verketteter Vorgänge. ZAMM - Journal of Applied Mathematics and Mechanics, 3(4), 279–289.
Fazekas, I., Klesov, O. (2001). On a General Approach to the Strong Laws of Large Numbers. Theory of Probability and its Application, 45(3), 436–449.
Flajolet, P., Gabarro, J., Pekari, H. (2005). Analytic urns. The Annal of Probability, 33(3), 1200–1233.
Janson, S. (2006). Limit theorems for triangular urn schemes. Probability Theory and Related Fields, 134(3), 417–452.
Konzem, S., Mahmoud, H. (2016). Characterization and enumeration of certain classes of Tenable Polya urn schemes growing under drawing multisets of balls. Methodology and Computing in Applied Probability, 18(2), 359–375.
Kuba, M., Mahmoud, H. (2016a). Two-colour balanced affine urn models with multiple drawings I: Central limit theorem. arXiv:1503.09069.
Kuba, M., Mahmoud, H. (2016b). Two-colour balanced affine urn models with multiple drawings II: large-index and triangular urns. arXiv:1509.09053.
Kuba, M., Mahmoud, H., Panholzer, A. (2013). Analysis of a generalized Friedman’s urn with multiple drawings. Discrete Applied Mathematics, 161, 2968–2984.
Lin, Z., Lu, C. (1996). Limit Theory for Mixing Dependent Random Variables. Boston: Kluwer Academic Publishers.
Longnecker, M., Serfling, R. J. (1977). General moment and probability inequalities for the maximum partial sum. Acta Mathematica, 30, 129–133.
Pagés, G., Laruelle, S. (2015). Randomized urns models revisited using stochastic approximation. Annals of Applied Probability, 23(4), 1409–1436.
Renlund, H. (2010). Generalized Polya urns via stochastic approximation. arXiv:1002.3716v1.
Renlund, H. (2011). Limit theorem for stochastic approxiamtion algorithm. arXiv:1102.4741v1.
Tsukiji, T., Mahmoud, H. (2001). A limit law for outputs in random circuits. Algorithmica, 31(3), 403–412.
Acknowledgements
The first author is grateful to the King Saud University, Deanship of Scientific Research, College of Science Research Center. The authors are grateful to anonymous referees for their valuable comments and corrections that improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Rafik, A., Nabil, L. & Olfa, S. A generalized urn with multiple drawing and random addition. Ann Inst Stat Math 71, 389–408 (2019). https://doi.org/10.1007/s10463-018-0651-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10463-018-0651-3