paper

Friedman vs Pólya

arXiv:2502.16768 · doi:10.1016/j.spl.2025.110635

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, and are well known and correspond respectively to Pólya's and Friedman's replacement schemes. We consider a mixture of both of these: with probability balls are replaced according to Friedman's recipe and with probability according to the one by Pólya. Independently of the initial urn composition and independently of , , and the value of , we show that the proportion of balls of one colour converges almost surely to . The latter is the limit behaviour obtained by using Friedman's scheme alone, i.e. when . Our result follows by adapting an argument due to D. S. Ornstein.

4 pages, 1 figure, corrected minor typos

Friedman vs Pólya · wovepaper