General Theory for Group Resetting with Application to Avoidance
Juhee Lee, Seong-Gyu Yang, Hye Jin Park, Ludvig Lizana
TL;DR
This work develops a general theory for group resetting in stochastic search under a drift potential by mapping the multi-particle dynamics to an effective center-of-mass coordinate $\zeta(t)$ that undergoes diffusion with coefficient $D/n$ and resetting at rate $r$. Resetting statistics are governed by a renewal equation for the reset-position distribution $R(\zeta,t)$, which couples to a Fokker-Planck equation for $P(\zeta,t)$. In the key extreme-value resetting scenario, the kernel $K_n(\zeta|\zeta';\tau)$ converges to a Gumbel distribution $\mathrm{Gumbel}(\zeta;\mu,\beta)$ for large $n$, enabling analytic expressions for stationary moments and scaling laws; for a harmonic potential, $\mu$ and $\beta$ are determined from OU propagators. The results show that the stationary mean $\langle\zeta\rangle_s$ grows as $\propto\sqrt{\ln n}$ with group size and increases with reset rate, while the SCV $\sigma_\zeta^2/\langle\zeta\rangle_s^2$ decreases with $n$ and $r$, informing the effectiveness of group avoidance. The framework is validated against simulations and extended to group-avoidance problems, with potential applications in swarm-optimization and artificial-selection protocols that exploit group-level resetting strategies.
Abstract
We present a general theoretical framework for group resetting dynamics in a potential landscape. While traditional resetting models typically focus on a single particle, we consider a group of particles whose collective dynamics govern the resetting. We extend existing resetting theories to cover extreme-value group resetting. This has applications from bacterial evolution under antibiotic pressure to swarm-search optimization. Using renewal theory, we derive a Fokker-Planck equation for the spatial distribution of the group's center of mass, treated as an effective particle. This formalism yields analytical expressions for key observables such as the stationary mean position and variance. We also study a group avoidance problem, where the particles must avoid an undesirable region. Such problems have recently been studied in contexts such as preventing critically high water levels in dams and controlling excessive financial leverage. Our framework offers new insight into how resetting can optimize group-level search and avoidance strategies.
