Related papers: Analytic urns
Interacting urns with exponential reinforcement were introduced and studied in Launay (2011). As its parameter $\rho$ tends to $\iy$, this reinforcement mechanism converges to the "generalized" reinforcement, in which the probability of…
Consider the multicolored urn model where, after every draw, balls of the different colors are added to the urn in a proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not…
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…
In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…
Consider two urns, $A$ and $B$, where initially $A$ contains a large number $n$ of balls and $B$ is empty. At each step, with equal probability, either we pick a ball at random in $A$ and place it in $B$, or vice-versa (provided of course…
We study a P\'olya-type urn model defined as follows. Start at time 0 with a single ball of some colour. Then, at each time n>0, choose a ball from the urn uniformly at random. With probability 1/2<p<1, return the ball to the urn along with…
This article proposes a unified analytical approach leading to a partial resolution of the Erdos-Straus, Sierpinski conjectures, and their generalization. We introduce an equivalent reformulation of these conjectures while constructing two…
We describe a universality class of the transitions of a generalized P\'{o}lya urn by studying the asymptotic behavior of the normalized correlation function $C(t)$ using finite-size scaling analysis. $X(1),X(2),\cdots$ are the successive…
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…
Adaptive randomly reinforced urn (ARRU) is a two-color urn model where the updating process is defined by a sequence of non-negative random vectors $\{(D_{1,n}, D_{2,n});n\geq1\}$ and randomly evolving thresholds which utilize accruing…
We consider a mean-field dynamical urn model, defined by rules which give the rate at which a ball is drawn from an urn and put in another one, chosen amongst an assembly. At equilibrium, this model possesses a fluid and a condensed phase,…
This paper explores the distribution of indistinguishable balls into distinct urns with varying capacity constraints, a foundational issue in combinatorial mathematics with applications across various disciplines. We present a comprehensive…
Generalized Friedman urn is one of the simplest and most useful models considered in probability theory. Since Athreya and Ney (1972) showed the almost sure convergence of urn proportions in a randomized urn model with irreducible…
Using P\'{o}lya's urn model with negative replacement we introduce a new Bernstein-type operator and we show that the new operator improves upon the known estimates for the classical Bernstein operator. We also provide numerical evidence…
Let $G$ be a finite Abelian group of order $d$. We consider an urn in which, initially, there are labeled balls that generate the group $G$. Choosing two balls from the urn with replacement, observe their labels, and perform a group…
A P\'olya urn process is a Markov chain that models the evolution of an urn containing some coloured balls, the set of possible colours being $\{1,\ldots,d\}$ for $d\in \mathbb{N}$. At each time step, a random ball is chosen uniformly in…
Motivated by mathematical tissue growth modelling, we consider the problem of approximating the dynamics of multicolor P\'olya urn processes that start with large numbers of balls of different colors and run for a long time. Using strong…
We give bounds for (central) moments for balanced P\'olya urns under very general conditions. In some cases, these bounds imply that moment convergence holds in earlier known results on asymptotic distribution. The results overlap with…
A cyclic urn is an urn model for balls of types $0,\ldots,m-1$ where in each draw the ball drawn, say of type $j$, is returned to the urn together with a new ball of type $j+1 \mod m$. The case $m=2$ is the well-known Friedman urn. The…
We consider triangular P\'olya urns and show under very weak conditions a general strong limit theorem of the form $X_{ni}/a_{ni}\to \mathcal{X}_i$ a.s., where $X_{ni}$ is the number of balls of colour $i$ after $n$ draws; the constants…