Analytic urns

Annals of Probability

Volumn 33, Issue 3, 2005, Pages 1200-1233

  Flajolet, Philippe ^a,b   Gabarró, Joaquim ^a   Pekari, Helmut ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b INRIA ROCQUENCOURT   (France)

Author keywords

Analytic function; Elliptic function; Large deviations; P lya urn; Search tree; Urn model

Indexed keywords

EID: 18844387680     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/009117905000000026     Document Type: Article

References (38)

1. ALDOUS, D. (1991). Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab. 1 228-266.
2. ALDOUS, D., FLANNERY, B. and PALACIOS, J. L. (1988). Two applications of urn processes - The fringe analysis of trees and the simulation of quasi-stationary distributions of Markov chains. Probab. Engrg. Inform. Sci. 2 293-307.
3. ATHREYA, K. B. and NEY, P. E. (1972). Branching Processes. Springer, New York.
4. BAGCHI, A. and PAL, A. K. (1985). Asymptotic normality in the generalized Pólya-Eggenberger urn model, with an application to computer data structures. SIAM J. Algebraic Discrete Methods 6 394-405.
5. BENDER, E. A. (1973). Central and local limit theorems applied to asymptotic enumeration. J. Combin. Theory 15 91-111.
6. BERGER, M. (1977). Géométrie 1. Actions de Groupes, Espaces Affines et Projectifs. CEDIC, Paris. [English translation published in Universitext. Springer, Berlin (1987).]
7. BERGERON, F., LABELLE, G. and LEROUX, P. (1998). Combinatorial Species and Tree-Like Structures. Cambridge Univ. Press.
8. BILLINGSLEY, P. (1986). Probability and Measure, 2nd ed. Wiley, New York.
9. CHANDRASEKHARAN, K. (1985). Elliptic Functions. Springer, Berlin.
10. DEN HOLLANDER, F. (2000). Large Deviations. Amer. Math. Soc., Providence, RI.
11. EISENBARTH, B., ZIVIANI, N., GÓNNET, G. H., MEHLHORN, K. and WOOD, D. (1982). The theory of fringe analysis and its application to 2-3 trees and B-trees. Inform, and Control 55 125-174.
12. FLAJOLET, P. and ODLYZKO, A. M. (1990). Singularity analysis of generating functions. SIAM J. Algebraic Discrete Methods 3 216-240.
13. FLAJOLET, P. and SEDGEWICK, R. (2003). Analytic Combinatorics. (Book in preparation; individual chapters are available electronically.)
14. FRIEDMAN, B. (1949). A simple urn model. Comm. Pure Appl. Math. 2 59-70.
15. GOUET, R. (1993). Martingale functional central limit theorems for a generalized Pólya urn. Ann. Probab. 21 1624-1639.
16. GOULDEN, I. P. and JACKSON, D. M. (1983). Combinatorial Enumeration. Wiley, New York.
17. GRAHAM, R. L., KNUTH, D. E. and PATASHNIK, O. (1989). Concrete Mathematics. Addison-Wesley, Reading, MA.
18. HWANG, H.-K. (1996). Large deviations for combinatorial distributions. I. Central limit theorems. Ann. Appl. Probab. 6 297-319.
19. HWANG, H.-K. (1998). On convergence rates in the central limit theorems for combinatorial structures. European J. Combin. 19 329-343.
20. JANSON, S. (2004). Functional limit theorems for multitype branching processes and generalized Pólya urns. Stochastic Process. Appl. 110 177-245.
21. JANSON, S. (2005). Limit theorems for triangular urn schemes. Probab. Theory Related Fields. To appear.
22. JOHNSON, N. L. and KOTZ, S. (1977). Urn Models and Their Application. Wiley, New York.
23. KNUTH, D. E. (1998). The An of Computer Programming, 2nd ed. Addison-Wesley, Reading, MA.
24. KOTZ, S., MAHMOUD, H. and ROBERT, P. (2000). On generalized Pólya urn models. Statist. Probab. Lett. 49 163-173.
25. LANG, S. (1982). Introduction to Algebraic and Abelian Functions, 2nd ed. Springer, New York.
26. LUKACS, E. (1970). Characteristic Functions. Griffin, London.
27. MAHMOUD, H. (1998). On rotations in fringe-balanced binary trees. Inform. Process. Lett. 65 41-46.
28. MAHMOUD, H. M. (1992). Evolution of Random Search Trees. Wiley, New York.
29. NEHARI, Z. (1975). Conformal Mapping. Dover, New York. (Reprinting of the 1952 edition.)
30. ODLYZKO, A. M. (1995). Asymptotic enumeration methods. In Handbook of Combinatorics 2 (R. Graham, M. Grötschel and L. Lovász, eds.) 1063-1229. North-Holland, Amsterdam.
31. PANHOLZER, A. and PRODINGER, H. (1998). An analytic approach for the analysis of rotations in fringe-balanced binary search trees. Ann. Combin. 2 173-184.
32. ROTA, G.-C. (1975). Finite Operator Calculus. Academic Press, New York.
33. SMYTHE, R. T. (1996). Central limit theorems for urn models. Stochastic Process. Appl. 65 115-137.
34. TAYLOR, M. E. (1996). Partial Differential Equations 1. Springer, New York.
35. WHITTAKER, E. T. and WATSON, G. N. (1927). A Course of Modern Analysis, 4th ed. Cambridge Univ. Press. (Reprinted 1973.)
36. YAO, A. C. C. (1978). On random 2-3 trees. Acta Inform. 9 159-170.
37. YOSHIDA, M. (1997). Hypergeometric Functions, My Love. Vieweg, Braunschweig.
38. ZWILLINGER, D. (1989). Handbook of Differential Equations. Academic Press, New York.