Related papers: Positive reinforced generalized time-dependent P\'…
In this paper, we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the \emph{negatively…
A classical P\'olya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in…
We introduce a class of reinforcement models where, at each time step $t$, one first chooses a random subset $A_t$ of colours (independent of the past) from $n$ colours of balls, and then chooses a colour $i$ from this subset with…
We define and prove limit results for a class of dominant P\'olya sequences, which are randomly reinforced urn processes with color-specific random weights and unbounded number of possible colors. Under fairly mild assumptions on the…
We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by…
P\'{o}lya urn is a stochastic process in which balls are randomly drawn from an urn of red and blue balls, and balls of the same color as the drawn balls are added. The probability of a ball of a certain color being drawn is equal to the…
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 consider a system of urns of Polya-type, with balls of two colors; the reinforcement of each urn depends both on the content of the same urn and on the average content of all urns. We show that the urns synchronize almost surely, in the…
P{\'o}lya urns are urns where at each unit of time a ball is drawn and is replaced with some other balls according to its colour. We introduce a more general model: The replacement rule depends on the colour of the drawn ball and the value…
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…
Balls and bins models are classical probabilistic models where balls are added to bins at random according to a certain rule. The balls and bins model with feedback is a non-linear generalisation of the P\'olya urn, where the probability of…
P\'olya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of…
Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that same urn with probability $p$, and from a randomly chosen…
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…
The generalized P\`olya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in…
We consider a version of the classical P\'olya urn scheme which incorporates innovations. The space $S$ of colors is an arbitrary measurable set. After each sampling of a ball in the urn, one returns $C$ balls of the same color and…
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…
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…
The P\'olya urn scheme is a discrete-time process concerning the addition and removal of colored balls. There is a known embedding of it in continuous-time, called the P\'olya process. We deal with a generalization of this stochastic model,…
The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…