Propagation of Chaos for a Balls into Bins Model

Abstract

Consider a finite number of balls initially placed in L bins. At each time step a ball is taken from each non-empty bin. Then all the balls are uniformly reassigned into bins. This finite Markov chain is called Repeated Balls-into-Bins process and is a discrete time interacting particle system with parallel updating. We prove that, starting from a suitable (chaotic) set of initial states, as L+∞, the numbers of balls in each bin becomes independent from the rest of the system i.e. we have propagation of chaos. We furthermore study some equilibrium properties of the limiting nonlinear process.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…