English
Related papers

Related papers: Fully Analyzing an Algebraic Polya Urn Model

200 papers

Consider an urn model whose replacement matrix is triangular, has all entries nonnegative and the row sums are all equal to one. We obtain the strong laws for the counts of balls corresponding to each color. The scalings for these laws…

Probability · Mathematics 2010-09-27 Arup Bose , Amites Dasgupta , Krishanu Maulik

This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…

Probability · Mathematics 2020-04-13 Mikhail Menshikov , Vadim Shcherbakov

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…

Probability · Mathematics 2019-09-27 Giacomo Aletti , Andrea Ghiglietti , Anand Vidyashankar

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…

Probability · Mathematics 2025-02-07 Jingwei Li , Thomas G. Robertazzi

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…

Probability · Mathematics 2023-12-12 Hristo Sariev , Sandra Fortini , Sonia Petrone

The Generalized P\'{o}lya Urn (GPU) is a popular urn model which is widely used in many disciplines. In particular, it is extensively used in treatment allocation schemes in clinical trials. In this paper, we propose a sequential…

Probability · Mathematics 2007-05-23 Li-X. Zhang , Feifang Hu , Siu Hung Cheung

We consider a generalization of the Bernoulli-Laplace model in which there are two urns and $n$ total balls, of which $r$ are red and $n - r$ white, and where the left urn holds $m$ balls. At each time increment, $k$ balls are chosen…

Given $n$ colored balls, we want to detect if more than $\lfloor n/2\rfloor$ of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to…

Data Structures and Algorithms · Computer Science 2016-05-02 Paweł Gawrychowski , Jukka Suomela , Przemysław Uznański

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

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…

Probability · Mathematics 2024-03-22 Svante Janson

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…

Probability · Mathematics 2019-11-05 Norbert Henze , Mark P. Holmes

This study analyzes pass networks in football (soccer) using a stochastic model known as the P\'olya urn. By focusing on preferential selection, it theoretically demonstrates that the time evolution of networks can be characterized by a…

Physics and Society · Physics 2025-12-19 Ken Yamamoto

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…

Combinatorics · Mathematics 2010-05-11 Markus Kuba

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…

Networking and Internet Architecture · Computer Science 2009-06-20 Christine Fricker , Fabrice Guillemin , Philippe Robert

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

Statistical Mechanics · Physics 2015-06-24 C. Godreche , J. M. Luck

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…

Probability · Mathematics 2015-07-30 Noela S. Müller , Ralph Neininger

A certain sampling process, concerning an urn with balls of two colors, proposed in 1965 by B.E. Oakley and R.L. Perry, and discussed by Peter Winkler and Martin Gardner, that has an extremely simple answer for the probability, namely the…

Combinatorics · Mathematics 2018-01-08 Shalosh B. Ekhad , Doron Zeilberger

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…

Probability · Mathematics 2015-02-24 Andrea Ghiglietti , Anand N. Vidyashankar , William F. Rosenberger

The two-parameter Poisson-Dirichlet diffusion takes values in the infinite ordered simplex and extends the celebrated infinitely-many-neutral-alleles model, having a two-parameter Poisson-Dirichlet stationary distribution. Here we identify…

Probability · Mathematics 2024-10-16 Robert C. Griffiths , Matteo Ruggiero , Dario Spanò , Youzhou Zhou

A cyclic urn is an urn model for balls of types $0,\ldots,m-1$. The urn starts at time zero with an initial configuration. Then, in each time step, first a ball is drawn from the urn uniformly and independently from the past. If its type is…

Probability · Mathematics 2019-03-14 Noela Müller , Ralph Neininger
‹ Prev 1 3 4 5 6 7 10 Next ›