Skip to main content
Log in

A unified presentation of some urn models

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

For a sequence ofm urns we investigate how the number of urns satisfying a certain condition (e.g., being empty) evolves in time when after each time unit a ball is thrown. We show for a variety of urn models that this process (suitably normalized) converges weakly to a Gaussian process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. E. A. Bender and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration, II: multivariate generating functions,J. Combin. Theory Ser. A 34, 255–265, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Billingsley,Convergence of Probability Measures, Wiley, New York, 1968.

    MATH  Google Scholar 

  3. S. Boucheron and D. Gardy, An urn model from learning theory,Random Struct. Algorithms 10, 43–67. 1997.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Drmota, A bivariate asymptotic expansion of coefficients of powers of generating functions,European J. Combin. 15, 139–152, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Flajolet and J. S. Vitter, Average-case analysis of algorithms and data structures, inHandbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A: Algorithms and Complexity. North-Holland, Amsterdam, 1990, chapter 9, pp. 431–524.

    Google Scholar 

  6. D. Gardy, Normal limiting distributions for projection and semijoin sizes,SIAM J. Discrete Math. 5(2), 219–248, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. D. Gardy, Join sizes, urn models and normal limiting distributions,Theoret. Comput. Sci. (A) 131, 375–414, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  8. D. Gardy and G. Louchard, Dynamic analysis of some relational data bases parameters,Theoret. Comput. Sci. (A) (special issue on mathematical analysis of algorithms)144(1–2), 125–159, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. I. P. Goulden and D. M. Jackson,Combinatorial Enumeration, Wiley, New York, 1983.

    MATH  Google Scholar 

  10. I. Karatzas and S. E. Shreve,Brownian Motion and Stochastic Calculus, Springer-Verlag, New York, 1988.

    MATH  Google Scholar 

  11. V. F. Kolchin, B. Sevast’yanov, and V. Chistyakov,Random Allocations, Wiley, New York, 1978.

    Google Scholar 

  12. J. Neveu,Processus aléatoires gaussiens, Presses de l’Université de Montréal, Montréal, 1968.

    MATH  Google Scholar 

  13. D. Revuz and M. Yor,Continuous Martingales and Brownian Motion, Springer-Verlag, New York, 1991.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by H. Prodinger and W. Szpankowski.

The first and third authors’ work was supported by the Austrian Science Foundation FWF, Grant P10187-MAT. The second author was also supported by the Austrian-French project AMADEUS No. 97049.

Online publication September 22, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drmota, M., Gardy, D. & Gittenberger, B. A unified presentation of some urn models. Algorithmica 29, 120–147 (2001). https://doi.org/10.1007/BF02679616

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02679616

Key Words

Navigation