Probability theory and stochastic processes Special processes Example
Pólya urn model
Example
Let and be integers. An urn holds red balls and 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 and be the numbers of red and black balls after steps, so . Then is a Markov chain, since the next draw depends only on the current contents. From it moves to with probability and to otherwise.
The fraction of red balls is a martingale: It takes values in , so it converges almost surely, and its limit has the beta distribution with parameters and .
Remarks
For the limit is uniform on , and is uniform on for each . 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 , the draws are independent with probability of red. The urn shows that a random process can have a random limit: the rich get richer.
Further reading
About this page
| Tag | DHPXDFEEMF |
|---|---|
| URI | m2://DHPXDFEEMF |
| Kind | example |
| Writing | W0 stub |
| MSC | 60C05, 60G42, 60J10 |
| Instance of | Markov chain |
| Same as | |
| Changed | 2 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.