Central limit theorems for urn models

Abstract We consider central limit theory for urn models in which balls are not necessarily replaced after being drawn, giving rise to negative diagonal entries in the generating matrix. Under conditions on the eigenvalues and eigenvectors, we give results both for the contents of the urn and the number of times balls of each type are drawn.

[1]  B. Friedman,et al.  A simple urn model , 1949 .

[2]  Hosam M. Mahmoud,et al.  Probabilistic Analysis of Bucket Recursive Trees , 1995, Theor. Comput. Sci..

[3]  L. J. Wei,et al.  Statistical Inference with Data-Dependent Treatment Allocation Rules , 1990 .

[4]  C. C. Heyde,et al.  On the number of terminal vertices in certain random trees with an application to stemma construction in philology , 1982, Journal of Applied Probability.

[5]  K. Athreya.  Limit theorems for multitype continuous time Markov branching processes , 1969 .

[6]  D. Freedman.  Bernard Friedman's Urn , 1965 .

[7]  Samuel Karlin,et al.  Limit Theorems for the Split Times of Branching Processes , 1967 .

[8]  William F. Rosenberger,et al.  Play-the-winner designs, generalized Polya urns, and Markov branching processes , 1995 .

[9]  K. Athreya,et al.  Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems , 1968 .

[10]  Norman L. Johnson,et al.  Urn models and their application , 1977 .

[11]  William F. Rosenberger,et al.  Variance in randomized play-the-winner clinical trials , 1997 .

[12]  L. J. Wei,et al.  The Randomized Play-the-Winner Rule in Medical Trials , 1978 .

[13]  Jerzy Szymanski,et al.  On the Structure of Random Plane-oriented Recursive Trees and Their Branches , 1993, Random Struct. Algorithms.

[14]  Limit theorems for multitype continuous time Markov branching processes: I. The case of an eigenvector linear functional , 1969 .

[15]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[16]  Amitava Bagchi,et al.  Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures , 1985 .

[17]  J. Ian Munro,et al.  The Analysis of a Fringe Heuristic for Binary Search Trees , 1985, J. Algorithms.