English
Related papers

Related papers: The equalization probability of the Polya urn

200 papers

Urn models play an important role to express various basic ideas in probability theory. Here we extend this urn model with tubes. An urn contains coloured balls, which can be drawn with probabilities proportional to the numbers of balls of…

Probability · Mathematics 2024-08-07 Bart Jacobs

We show how to simulate a roll of a fair $n$-sided die by one flip of a biased coin with probability $1/n$ of coming up heads, followed by $3\lfloor\log_2 n \rfloor+1$ flips of a fair coin.

Combinatorics · Mathematics 2015-06-02 Giovanni Viglietta

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…

Probability · Mathematics 2017-09-05 Erol Peköz , Adrian Röllin , Nathan Ross

We study an urn process with two urns, initialized with a ball each. Balls are added sequentially, the urn being chosen independently with probability proportional to the $\alpha^{th}$ power $(\alpha >1)$ of the existing number of balls. We…

Probability · Mathematics 2026-01-14 Svante Janson , Subhabrata Sen , Joel Spencer

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

Probability · Mathematics 2014-10-10 Ernst Schulte-Geers , Wolfgang Stadje

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…

Probability · Mathematics 2007-05-23 Hemant Ishwaran , Mahmoud Zarepour

Suppose you and your friend both do $n$ tosses of an unfair coin with probability of heads equal to $\alpha$. What is the behavior of the probability that you obtain at least $d$ more heads than your friend if you make $r$ additional…

Probability · Mathematics 2012-03-19 Wenbo V. Li , Vladislav V. Vysotsky

This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…

Probability · Mathematics 2026-05-27 Jianan Shi , Qing Yin , Yu Miao

It is well known that in a small P\'olya urn, i.e., an urn where second largest real part of an eigenvalue is at most half the largest eigenvalue, the distribution of the numbers of balls of different colours in the urn is asymptotically…

Probability · Mathematics 2026-01-14 Svante Janson

What is the average number of tosses needed before a particular sequence of heads and tails turns up? We solve the problem didactically, starting with doubles, finding that a tail, followed by a head, turns up on the average after only four…

Probability · Mathematics 2019-10-08 Porter W. Johnson , David Atkinson

The $k$-majority game is played with $n$ numbered balls, each coloured with one of two colours. It is given that there are at least $k$ balls of the majority colour, where $k$ is a fixed integer greater than $n/2$. On each turn the player…

Combinatorics · Mathematics 2014-02-25 John R. Britnell , Mark Wildon

Consider the following probability puzzle: A fair coin is flipped n times. For each HT in the resulting sequence, Bob gets a point, and for each HH Alice gets a point. Who is more likely to win? We provide a proof that Bob wins more often…

Combinatorics · Mathematics 2024-05-28 Simon Segert

We prove an easy but very weak version of Chernoff inequality. Namely, that the probability that in $6M$ throws of a fair coin, one gets at most $M$ heads is $\leq 1/2^M$.

Probability · Mathematics 2025-07-08 Sariel Har-Peled

We consider the urn setting with two different objects, ``good'' and ``bad'', and analyze the number of draws without replacement until a good object is picked. Although the expected number of draws for this setting is a standard textbook…

Probability · Mathematics 2014-04-07 John Ahlgren

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…

Combinatorics · Mathematics 2012-07-25 Basile Morcrette , Hosam M. Mahmoud

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…

Probability · Mathematics 2016-12-01 Erik Thörnblad

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…

Statistical Mechanics · Physics 2021-11-10 Shintaro Mori , Masato Hisakado , Kazuaki Nakayama

If the product of two monic polynomials with real nonnegative coefficients has all coefficients equal to 0 or 1, does it follow that all the coefficients of the two factors are also equal to 0 or 1? Here is an equivalent formulation of this…

Probability · Mathematics 2022-09-21 Luca Ghidelli

Consider $n$ independent, biased coins, each with a known probability of heads. Presented with an ordering of these coins, flip (i.e., toss) each coin once, in that order, until we have observed both a *head* and a *tail*, or flipped all…

Data Structures and Algorithms · Computer Science 2025-10-21 Feyza Duman Keles , Lisa Hellerstein , Kunal Marwaha , Christopher Musco , Xinchen Yang