Almost sure convergence of Polya urn schemes

Abstract

For the most general Polya urn schemes, we establish the almost sure convergence of its composition. The only requirement is that there are always enough balls of both colors, so that the extractions can be indefinitely pursued according to the specifications of the model. We also consider the method for determining the probability of fulfilling this requirement, as a function of the initial number of balls of each color.