Related papers: Random replacements in P\'olya urns with infinitel…
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…
Measure-valued P\'olya urn sequences (MVPS) are a generalization of the observation processes generated by $k$-color P\'olya urn models, where the space of colors $\mathbb{X}$ is a complete separable metric space and the urn composition is…
We study an urn model introduced in the paper of Chen and Wei, 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,…
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 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 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…
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some…
This work is devoted to P\'olya-Young urns, a class of periodic P\'olya urns of importance in the analysis of Young tableaux. We provide several extension of the previous results of Banderier, Marchal and Wallner [Ann. Prob. (2020)] on…
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color…
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…
Consider an urn initially containing $b$ black and $w$ white balls. Select a ball at random and observe its color. If it is black, stop. Otherwise, return the white ball together with another white ball to the urn. Continue selecting at…
We define the notions of disjoint unions and products for generalised P\'olya urns, proving that this turns the set of isomorphism classes of urns into a commutative semiring. The set of square matrices up to similarity by a permutation…
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…
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…
Sufficient conditions are developed for a class of generalized Polya urn schemes ensuring exchangeability. The extended class includes the Blackwell-MacQueen Polya urn and the urn schemes for the two-parameter Poisson-Dirichlet process and…
This paper develops an analytic theory for the study of some Polya urns with random rules. The idea is to extend the isomorphism theorem in Flajolet et al. (2006), which connects deterministic balanced urns to a differential system for the…
Consider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn…
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…
We show that the supremum of the successive percentages of red balls in P\'olya's urn model is almost surely rational, give the set of values that are taken with positive probability and derive several exact distributional results for the…