Central limit theorems for urn models

Stochastic Processes and their Applications

Volumn 65, Issue 1, 1996, Pages 115-137

  Smythe, R T ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Generalized Polya urn models; Martingale central limit theorems; Recursive trees

Indexed keywords

EID: 0030582793     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-4149(96)00094-4     Document Type: Article

References (20)

1. K.B. Athreya, Limit theorems for multitype continuous time Markov branching processes I. The case of an eigenvector linear functional, Z. Wahrsch. Theorie Verwandte Gebiete 12 (1969a) 320-332.
2. K.B. Athreya, Limit theorems for multitype continuous time Markov branching processes II. The case of an arbitrary linear functional, Z. Wahrsch. Theorie Verwandte Gebiete 13 (1969b) 204-214.
3. K.B. Athreya and S. Karlin, Limit theorems for the split times of branching processes, J. Math. Mech. 17 (1967) 257-277.
4. K.B. Athreya and S. Karlin, Embedding of urn schemes into continuous time Markov branching processes and related limit theorems, Ann. Math. Statist. 39 (1968) 1801-1817.
5. K.B. Athreya and P.E. Ney, Branching Processes (Springer, New York, 1972).
6. A. Bagchi and A.K. Pal, Asymptotic normality in the generalized Polya-Eggenburger urn model, with an application to computer data structrures, SIAM J. Algebraic Discrete Methods 6 (1985) 394-405.
7. D. Freedman, Bernard Friedman's urn, Ann. Math. Statist. 36 (1965) 956-970.
8. B. Friedman, A simple urn model, Comm. Pure Math. 2 (1949) 59-70.
9. P. Hall and C. Heyde, Martingale Limit Theory and Applications (Academic Press, New York, 1980).
10. N. Johnson and S. Kotz, Urn models and their Applications (Wiley, New York, 1977).
11. S. Karlin and H.M. Taylor, A First Course in Stochastic Processes (Academic Press, New York, 2nd ed., 1975).
12. H. Mahmoud, R.T. Smythe and J. Szymański, On the structure of plane-oriented recursive trees and their branches, Random Struct. Algorithms 4 (1993) 151-176.
13. H. Mahmoud and R.T. Smythe, Probabilistic analysis of bucket recursive trees, Theoret. Comput. Sci. 144 (1995) 221-249.
14. D. Najock and C.C. Heyde, On the number of terminal vertices in certain random trees with an application to stemma construction in philology, J. Appl. Probab. 19 (1982) 675-680.
15. P.V. Poblete and J.I. Munro, The analysis of a fringe heuristic for binary search trees, J. Algorithms 6 (1985) 336-350.
16. W.F. Rosenberger, Asymptotic inference problems arising from clinical trials using response-adaptive treatment allocation, Doctoral Dissertation, George Washington University (1992).
17. R.T. Smythe and H. Mahmoud, A survey of recursive trees, Theory Probab. Math. Statist. 51, 1-29.
18. R.T. Smythe and W.F. Rosenberger, Play-the-winner designs, generalized Polya urns, and Markov branching processes, In: N. Flournoy and W.F. Rosenberger, Adaptive Designs, Institute of Mathematical Statistics Monograph Series 25 (Hayward, CA, 1995) pp. 13-22.
19. L.J. Wei and S. Durham, The randomized play-the-winner rule in medical trials, J. Amer. Statist. Assoc. 73 (1978) 840-843.
20. L.J. Wei, R.T. Smythe, D.Y. Lin and T.S. Park, Statistical inference with data-dependent treatment allocation rules, J. Amer. Statist. Assoc. 85 (1990) 156-162.