Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/105029
Title: Asymptotic theorems for urn models with nonhomogeneous generating matrices
Authors: Bai, Z.D. 
Hu, F. 
Keywords: 62L05
Adaptive designs
Asymptotic normality
Consistency
Generalized Friedman's urn model
Non-homogeneous generating matrix
Primary 62E20
Secondary 62F12
Issue Date: 1-Mar-1999
Citation: Bai, Z.D.,Hu, F. (1999-03-01). Asymptotic theorems for urn models with nonhomogeneous generating matrices. Stochastic Processes and their Applications 80 (1) : 87-101. ScholarBank@NUS Repository.
Abstract: The generalized Friedman's urn (GFU) model has been extensively applied to biostatistics. However, in the literature, all the asymptotic results concerning the GFU are established under the assumption of a homogeneous generating matrix, whereas, in practical applications, the generating matrices are often nonhomogeneous. On the other hand, even for the homogeneous case, the generating matrix is assumed in the literature to have a diagonal Jordan form and satisfies λ>2Re(λ1), where λ and λ1 are the largest eigenvalue and the eigenvalue of the second largest real part of the generating matrix (see Smythe, 1996, Stochastic Process. Appl. 65, 115-137). In this paper, we study the asymptotic properties of the GFU model associated with nonhomogeneous generating matrices. The results are applicable to a variety of settings, such as the adaptive allocation rules with time trends in clinical trials and those with covariates. These results also apply to the case of a homogeneous generating matrix with a general Jordan form as well as the case where λ=2Re(λ1).
Source Title: Stochastic Processes and their Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/105029
ISSN: 03044149
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

114
checked on Aug 17, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.