Asymptotic Theorems of Sequential Estimation - Adjusted Urn Models
نویسندگان
چکیده
The Generalized Pólya Urn (GPU) is a popular urn model which is widely used in many disciplines. In particular, it is extensively used in treatment allocation schemes in clinical trials. In this paper, we propose a sequential estimation-adjusted urn model (a nonhomogeneous GPU) which has a wide spectrum of applications. Because the proposed urn model depends on sequential estimations of unknown parameters, the derivation of asymptotic properties is mathematically intricate and the corresponding results are unavailable in the literature. We overcome these hurdles and establish the strong consistency and asymptotic normality for both the patient allocation and the estimators of unknown parameters, under some widely satisfied conditions. These properties are important for statistical inferences and they are also useful for the understanding of the urn limiting process. A superior feature of our proposed model is its capability to yield limiting treatment proportions according to any desired allocation target. The applicability of our model is illustrated with a number of examples.
منابع مشابه
Probabilistic Transforms for Combinatorial Urn Models
In this paper, we present several probabilistic transforms related to classical urn models. These transforms render the dependent random variables describing the urn occupancies into independent random variables with appropriate distributions. This simplifies the analysis of a large number of problems for which a function under investigation depends on the urn occupancies. The approach used for...
متن کاملCentral Limit Theorems for Generalized Pólya Urn Models
In this paper we obtain central limit theorems for generalized Pólya urn models with L ≥ 2 colors where one out ofK different replacements (actions) is applied randomly at each step. Each possible action constitutes a row of the replacement matrix, which can be nonsquare and random. The actions are chosen following a probability distribution given by an arbitrary function of the proportions of ...
متن کاملGeneralized Pólya Urn Designs with Null Balance
In this paper we propose a class of sequential urn designs based on generalized Pólya urn (GPU) models for balancing the allocations of two treatments in sequential clinical trials. In particular, we consider a GPU model characterized by a 2× 2 random addition matrix with null balance (i.e. null row sums) and replacement rule depending upon the urn composition. Under this scheme, the urn proces...
متن کاملLimit Theorems for Triangular Urn Schemes
We study a generalized Pólya urn with balls of two colours and a triangular replacement matrix; the urn is not required to be balanced. We prove limit theorems describing the asymptotic distribution of the composition of the urn after a long time. Several different types of asymptotics appear, depending on the ratio of the diagonal elements in the replacement matrix; the limit laws include norm...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کامل