Individual based and mean-field modelling of direct aggregation
Martin Burger, Jan Haskovec, Marie-Therese Wolfram

TL;DR
This paper introduces novel individual-based and mean-field models of biological aggregation driven solely by density-dependent stochasticity reduction, with mathematical analysis and numerical simulations demonstrating pattern formation and steady states.
Contribution
It presents new models where aggregation emerges without explicit forces, based on stochasticity reduction, and provides rigorous analysis and simulations of these models.
Findings
Existence of weak solutions for the first-order model
Conditions for pattern formation identified
Numerical simulations confirm theoretical results
Abstract
We introduce two models of biological aggregation, based on randomly moving particles with individual stochasticity depending on the perceived average population density in their neighbourhood. In the first-order model the location of each individual is subject to a density-dependent random walk, while in the second-order model the density-dependent random walk acts on the velocity variable, together with a density-dependent damping term. The main novelty of our models is that we do not assume any explicit aggregative force acting on the individuals; instead, aggregation is obtained exclusively by reducing the individual stochasticity in response to higher perceived density. We formally derive the corresponding mean-field limits, leading to nonlocal degenerate diffusions. Then, we carry out the mathematical analysis of the first-order model, in particular, we prove the existence of weak…
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
TopicsMathematical Biology Tumor Growth · Gene Regulatory Network Analysis · Ecosystem dynamics and resilience
