Random partitions of the plane via Poissonian coloring, and a self-similar process of coalescing planar partitions
Abstract
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions converge (in some sense) to a random partition of the plane. We prove a weak version of this, showing that normalized empirical measures converge to Lebesgue measures on a random partition into measurable sets. Topological properties remain an open problem. In the course of the proof, which heavily exploits time-reversals, we encounter a novel self-similar process of coalescing planar partitions. In this process, sets A(z) in the partition are associated with Poisson random points z, and the dynamics are as follows. Points are deleted randomly at rate 1, when z is deleted, its set A(z) is adjoined to the set A(z) of the nearest other point z.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.