scholarly journals Detection of Phase Transition in Generalized Pólya Urn in Information Cascade Experiment

2016 ◽  
Vol 85 (3) ◽  
pp. 034002 ◽  
Author(s):  
Masafumi Hino ◽  
Yosuke Irie ◽  
Masato Hisakado ◽  
Taiki Takahashi ◽  
Shintaro Mori
1997 ◽  
Vol 34 (2) ◽  
pp. 426-435 ◽  
Author(s):  
Raúl Gouet

We prove strong convergence of the proportions Un/Tn of balls in a multitype generalized Pólya urn model, using martingale arguments. The limit is characterized as a convex combination of left dominant eigenvectors of the replacement matrix R, with random Dirichlet coefficients.


2009 ◽  
Vol 46 (03) ◽  
pp. 827-843 ◽  
Author(s):  
Rafik Aguech

In this paper we study a generalized Pólya urn with balls of two colors and a random triangular replacement matrix. We extend some results of Janson (2004), (2005) to the case where the largest eigenvalue of the mean of the replacement matrix is not in the dominant class. Using some useful martingales and the embedding method introduced in Athreya and Karlin (1968), we describe the asymptotic composition of the urn after the nth draw, for large n.


2006 ◽  
Vol 43 (4) ◽  
pp. 938-951 ◽  
Author(s):  
I. Higueras ◽  
J. Moler ◽  
F. Plo ◽  
M. San Miguel

In this paper we obtain central limit theorems for generalized Pólya urn models with L ≥ 2 colors where one out of K 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 the balls of different colors present in the urn. Moreover, under the same hypotheses it is proved that the covariance matrix of the asymptotic distribution is the solution of a Lyapunov equation, and a procedure is given to obtain the covariance matrix in an explicit form. Some applications of these results to random trees and adaptive designs in clinical trials are also presented.


2013 ◽  
Vol 50 (4) ◽  
pp. 1169-1186 ◽  
Author(s):  
May-Ru Chen ◽  
Markus Kuba

We study an urn model introduced in the paper of Chen and Wei (2005), where at each discrete time step m balls are drawn at random from the urn containing colors white and black. Balls are added to the urn according to the inspected colors, generalizing the well known Pólya-Eggenberger urn model, case m = 1. We provide exact expressions for the expectation and the variance of the number of white balls after n draws, and determine the structure of higher moments. Moreover, we discuss extensions to more than two colors. Furthermore, we introduce and discuss a new urn model where the sampling of the m balls is carried out in a step-by-step fashion, and also introduce a generalized Friedman's urn model.


2006 ◽  
Vol 43 (04) ◽  
pp. 938-951
Author(s):  
I. Higueras ◽  
J. Moler ◽  
F. Plo ◽  
M. San Miguel

In this paper we obtain central limit theorems for generalized Pólya urn models with L ≥ 2 colors where one out of K 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 the balls of different colors present in the urn. Moreover, under the same hypotheses it is proved that the covariance matrix of the asymptotic distribution is the solution of a Lyapunov equation, and a procedure is given to obtain the covariance matrix in an explicit form. Some applications of these results to random trees and adaptive designs in clinical trials are also presented.


2019 ◽  
Vol 34 (4) ◽  
pp. 469-483
Author(s):  
May-Ru Chen

In this paper, we consider a generalized Pólya urn model with multiple drawings and time-dependent reinforcements. Suppose an urn initially contains w white and r red balls. At the nth action, m balls are drawn at random from the urn, say k white and m−k red balls, and then replaced in the urn along with cnk white and cn(m − k) red balls, where {cn} is a given sequence of positive integers. Repeat the above procedure ad infinitum. Let Xn be the proportion of the white balls in the urn after the nth action. We first show that Xn converges almost surely to a random variable X. Next, we give a necessary and sufficient condition for X to have a Bernoulli distribution with parameter w/(w + r). Finally, we prove that X is absolutely continuous if {cn} is bounded.


2007 ◽  
Vol 44 (03) ◽  
pp. 661-669 ◽  
Author(s):  
Alessandro Baldi Antognini ◽  
Simone Giannerini

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 x 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 process has a Markovian structure and can be regarded as a random extension of the classical Ehrenfest model. We establish almost sure convergence and asymptotic normality for the frequency of treatment allocations and show that in some peculiar cases the asymptotic variance of the design admits a natural representation based on the set of orthogonal polynomials associated with the corresponding Markov process.


2010 ◽  
Vol 4 (2) ◽  
pp. 145-171 ◽  
Author(s):  
Sameena Shah ◽  
Ravi Kothari ◽  
Jayadeva ◽  
Suresh Chandra

1997 ◽  
Vol 34 (02) ◽  
pp. 426-435 ◽  
Author(s):  
Raúl Gouet

We prove strong convergence of the proportions Un /Tn of balls in a multitype generalized Pólya urn model, using martingale arguments. The limit is characterized as a convex combination of left dominant eigenvectors of the replacement matrix R, with random Dirichlet coefficients.


Sign in / Sign up

Export Citation Format

Share Document