A unified presentation of some urn models

@article{Drmota2001AUP,
  title={A unified presentation of some urn models},
  author={Michael Drmota and Dani{\`e}le Gardy and Bernhard Gittenberger},
  journal={Algorithmica},
  year={2001},
  volume={29},
  pages={120-147}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

B

V. F. Kolchin
Sevast’yanov, and V. Chistyakov, Random Allocations, Wiley, New York • 1978
View 3 Excerpts
Highly Influenced

An urn model from learning theory

Random Struct. Algorithms • 1997
View 4 Excerpts

Join sizes

D. Gardy
urn models and normal limiting distributions, Theoretical Computer Science (A), 131, 375-414 • 1994

Average-Case Analysis of Algorithms and Data Structures

Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity • 1990

Brownian Motion and Stochastic Calculus

I. Karatzas, S. E. Shreve
Springer, New York • 1988

Similar Papers

Loading similar papers…