Friedman vs P\'olya

Abstract

Suppose an urn contains initially any number of balls of two colours. One ball is drawn randomly and then put back with α balls of the same colour and β balls of the opposite colour. Both cases, β=0 and β>0 are well known and correspond respectively to P\'olya's and Friedman's replacement schemes. We consider a mixture of both of these: with probability p∈(0,1] balls are replaced according to Friedman's recipe and with probability 1-p according to the one by P\'olya. Independently of the initial urn composition and independently of α, β, and the value of p>0, we show that the proportion of balls of one colour converges almost surely to 12. The latter is the limit behaviour obtained by using Friedman's scheme alone, i.e. when p=1. Our result follows by adapting an argument due to D. S. Ornstein.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…