Math 2.0

Probability theory and stochastic processes Special processes Example

Pólya urn model

Example

Let a≥1a \ge 1 and b≥1b \ge 1 be integers. An urn holds aa red balls and bb black balls. At each step one draws a ball uniformly at random and notes its colour. Then one puts it back together with one more ball of the same colour. Let RnR_n and BnB_n be the numbers of red and black balls after nn steps, so Rn+Bn=a+b+nR_n + B_n = a + b + n. Then (Rn,Bn)(R_n, B_n) is a Markov chain, since the next draw depends only on the current contents. From (r,k)(r, k) it moves to (r+1,k)(r + 1, k) with probability r/(r+k)r/(r + k) and to (r,k+1)(r, k + 1) otherwise.

The fraction Mn=Rn/(a+b+n)M_n = R_n / (a + b + n) of red balls is a martingale: 𝔼[Mn+1∣Rn,Bn]=RnRn+Bn⋅Rn+1Rn+Bn+1+BnRn+Bn⋅RnRn+Bn+1=RnRn+Bn=Mn.\mathbb{E}[M_{n+1} \mid R_n, B_n] = \frac{R_n}{R_n + B_n} \cdot \frac{R_n + 1}{R_n + B_n + 1} + \frac{B_n}{R_n + B_n} \cdot \frac{R_n}{R_n + B_n + 1} = \frac{R_n}{R_n + B_n} = M_n. It takes values in [0,1][0, 1], so it converges almost surely, and its limit has the beta distribution with parameters aa and bb.

Remarks

For a=b=1a = b = 1 the limit is uniform on [0,1][0, 1], and RnR_n is uniform on {1,2,…,n+1}\set{1, 2, \ldots, n + 1} for each nn. The sequence of colours drawn is exchangeable: the probability of a sequence depends only on how many red and black draws it contains. By de Finetti's theorem, given the limit fraction MM, the draws are independent with probability MM of red. The urn shows that a random process can have a random limit: the rich get richer.

Further reading

  1. Web https://en.wikipedia.org/wiki/Pólya_urn_model
About this page
TagDHPXDFEEMF
URIm2://DHPXDFEEMF
Kindexample
WritingW0 stub
MSC60C05, 60G42, 60J10
Instance ofMarkov chain
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.