Competition in a system of Brownian particles: Encouraging achievers
P. L. Krapivsky, Ohad Vilk, Baruch Meerson

TL;DR
This paper models a competitive system of Brownian particles, revealing a hydrodynamic description of the density evolution, a self-similar expanding halo, and the unbounded growth of the leader's distance, supported by simulations.
Contribution
It introduces a novel analytical and numerical framework for inter-agent competition among Brownian particles, extending to multiple competitors and connecting to epidemic models.
Findings
Hydrodynamic theory predicts a stationary density profile with a power-law tail.
A self-similar expanding halo surrounds the stationary profile.
The leader's distance from the origin grows as lt, unbounded over time.
Abstract
We introduce and study analytically and numerically a simple model of inter-agent competition, where underachievement is strongly discouraged. We consider particles performing independent Brownian motions on the line. Two particles are selected at random and at random times, and the particle closest to the origin is reset to it. We show that, in the limit of , the dynamics of the coarse-grained particle density field can be described by a nonlocal hydrodynamic theory which was encountered in a study of the spatial extent of epidemics in a critical regime. The hydrodynamic theory predicts relaxation of the system toward a stationary density profile of the "swarm" of particles, which exhibits a power-law decay at large distances. An interesting feature of this relaxation is a non-stationary "halo" around the stationary solution, which continues to expand in a…
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.
Taxonomy
TopicsComplex Systems and Time Series Analysis · Stochastic processes and statistical mechanics · Complex Network Analysis Techniques
