The simple harmonic urn
Edward Crane, Nicholas Georgiou, Stanislav Volkov, Andrew R. Wade,, Robert J. Waters

TL;DR
This paper introduces a generalized Pólya urn model with swapping dynamics, analyzes its recurrence and transience properties, and explores its connections to Bessel diffusions, percolation, and classical stochastic processes, providing new insights and asymptotics.
Contribution
It presents a novel urn model with swapping rules, establishes its recurrence/transience behavior, and links it to Bessel diffusions and classical processes, addressing open problems.
Findings
The urn process is transient without ball removal, recurrent with removal at swaps.
The embedded process scales to a Bessel diffusion squared.
The associated percolation model forms an infinite tree with one end.
Abstract
We study a generalized P\'{o}lya urn model with two types of ball. If the drawn ball is red, it is replaced together with a black ball, but if the drawn ball is black it is replaced and a red ball is thrown out of the urn. When only black balls remain, the roles of the colors are swapped and the process restarts. We prove that the resulting Markov chain is transient but that if we throw out a ball every time the colors swap, the process is recurrent. We show that the embedded process obtained by observing the number of balls in the urn at the swapping times has a scaling limit that is essentially the square of a Bessel diffusion. We consider an oriented percolation model naturally associated with the urn process, and obtain detailed information about its structure, showing that the open subgraph is an infinite tree with a single end. We also study a natural continuous-time embedding of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
