Related papers: Polya urns via the contraction method

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 study a new class of time inhomogeneous P\'olya-type urn schemes and give optimal rates of convergence for the distribution of the properly scaled number of balls of a given color to nearly the full class of generalized gamma…

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…

P\'olya processes are natural generalization of P\'olya-Eggenberger urn models. This article presents a new approach of their asymptotic behaviour {\it via} moments, based on the spectral decomposition of a suitable finite difference…

Generalized P\'olya urns with non-linear feedback are an established probabilistic model to describe the dynamics of growth processes with reinforcement, a generic example being competition of agents in evolving markets. It is well known…

We introduce an extension of the P\'olya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random…

This paper is devoted to a direct martingale approach for P{\'o}lya urn models asymptotic behaviour. A P{\'o}lya process is said to be small when the ratio of its remplacement matrix eigenvalues is less than or equal to 1/2, otherwise it is…

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 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 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…

We answer Problem 11.1 of Janson arXiv:1803.04207 on P\'olya urns associated with stable random walk. Our proof use neither martingales nor trees, but an approximation with a differential equation.

Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…

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…

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…

We study a generalized P\'{o}lya urn model with two types of ball. If the drawn ball is red, it is replaced together with a black ball, but if the drawn ball is black it is replaced and a red ball is thrown out of the urn. When only black…

Bona [2007+] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [1978]. Recently, Janson [2008+] showed the connection between Stirling permutations and plane…

Consider a P\'olya urn with balls of several colours, where balls are drawn sequentially and each drawn ball immediately is replaced together with a fixed number of balls of the same colour. It is well-known that the proportions of balls of…

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…

The fringe of a B-tree with parameter $m$ is considered as a particular P\'olya urn with $m$ colors. More precisely, the asymptotic behaviour of this fringe, when the number of stored keys tends to infinity, is studied through the…