Related papers: The simple harmonic urn
We introduce a multi-colour multi-urn generalisation of the Bernoulli-Laplace urn model, consisting of $d$ urns, $m$ colours, and $dmn$ balls, with $dn$ balls of each colour and $mn$ balls in each urn. At each step, one ball is drawn…
We propose an elementary but effective approach to studying a general class of Poissonized tenable and balanced urns on two colors. We characterize the asymptotic behavior of the process via a partial differential equation that governs the…
This article describes a purely analytic approach to urn models of the generalized or extended P\'olya-Eggenberger type, in the case of two types of balls and constant ``balance,'' that is, constant row sum. The treatment starts from a…
We consider an urn model, whose replacement matrix has all entries nonnegative and is balanced, that is, has constant row sums. We obtain the rates of the counts of balls corresponding to each color for the strong laws to hold. The analysis…
We propose a method of detecting a phase transition in a generalized P\'olya urn in an information cascade experiment. The method is based on the asymptotic behavior of the correlation $C(t)$ between the first subject's choice and the…
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…
The symmetric random walk is known to be recurrent in one and two dimensions, and becomes transient in three or higher dimensions. We compare the symmetric random walk to walks driven by certain \polya\ urns. We show that, in contrast, if…
We introduce a new model for contagion spread using a network of interacting finite memory two-color P\'{o}lya urns, which we refer to as the finite memory interacting P\'{o}lya contagion network. The urns interact in the sense that the…
Consider an urn model where at each step one of $q$ colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball.…
We collect, survey and develop methods of (one-dimensional) stochastic approximation in a framework that seems suitable to handle fairly broad generalizations of Polya urns. To show the applicability of the results we determine the limiting…
We propose an approach to analyze the asymptotic behavior of P\'olya urns based on the contraction method. For this, a new combinatorial discrete time embedding of the evolution of the urn into random rooted trees is developed. A…
We study the joint asymptotics of forward and backward processes of numbers of non-empty urns in an infinite urn scheme. The probabilities of balls hitting the urns are assumed to satisfy the conditions of regular decrease. We prove weak…
In classical urn models, one usually draws one ball with replacement at each time unit and then adds one ball of the same colour. Given a weight sequence $(w_k)_{k\in\N}$, the probability of drawing a ball of a certain colour is…
Though widely used in applications, reinforced random walk on graphs have never been the subject of a valid statistical inference. We develop in this paper a statistical framework for a general two-colored urn model. The probability to draw…
We consider in this paper an urn and ball problem with replacement, where balls are with different colors and are drawn uniformly from a unique urn. The numbers of balls with a given color are i.i.d. random variables with a heavy tailed…
This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…
In this paper, we prove functional limit theorems for P\'olya urn processes whose number of draws and initial number of balls tend to infinity together. This is motivated by recent work of Borovkov [5], where they prove a functional limit…
In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling…
We study the number of white balls in a classical P\'olya urn model with the additional feature that, at random times, a black ball is added to the urn. The number of draws between these random times are i.i.d. and, under certain moment…
We consider a model of N two-colors urns in which the reinforcement of each urn depends also on the content of all the other urns. This interaction is of mean-field type and it is tuned by a parameter $\alpha$ in [0,1]; in particular, for…