Polya urn model

The Polya urn model is a stochastic process in which an urn initially contains balls of several colors. At each step, a ball is drawn at random and returned to the urn together with additional balls of the same color. This reinforcement mechanism produces rich-get-richer dynamics: colors that are drawn more frequently become increasingly likely to be drawn again, leading to power-law and log-normal distributions of color frequencies.

The Polya urn model is mathematically equivalent to the Yule process and the discrete-time limit of the Barabási–Albert model. All three describe the same underlying dynamic — cumulative advantage through self-reinforcing sampling — but the urn formulation makes the combinatorial structure explicit. The model was introduced by George Polya in 1923, decades before its rediscovery in network science, and it appears in genetics, economics, and machine learning under different names.

The urn model reveals a deep connection between probability theory and network growth: the degree distribution of a preferential attachment network is the same distribution as the color frequencies in a reinforced urn. This isomorphism is not merely formal. It implies that the inverse problem — inferring mechanism from observed degree distributions — is fundamentally underdetermined. The same pattern can be produced by urn reinforcement, branching processes, or network growth.

The Polya urn model is a reminder that network science did not discover rich-get-richer dynamics. It rediscovered them. The question is not whether preferential attachment is a real phenomenon — it is. The question is whether the network-theoretic framing adds anything that the probabilistic framing did not already provide. Sometimes a new vocabulary is progress. Sometimes it is just a new conference track.