Non-uniqueness of the steady state for run-and-tumble particles with a double-well interaction potential
Abstract: We study $N$ run-and-tumble particles (RTPs) in one dimension interacting via a double-well potential $W(r)=-k_0 \, r2/2+g \, r4/4$, which is repulsive at short interparticle distance $r$ and attractive at large distance. At large time, the system forms a bound state where the density of particles has a finite support. We focus on the determination of the total density of particles in the stationary state $\rho_s(x)$, in the limit $N\to+\infty$. We obtain an explicit expression for $\rho_s(x)$ as a function of the ''renormalized" interaction parameter $k=k_0-3m_2$ where $m_2$ is the second moment of $\rho_s(x)$. Interestingly, this stationary solution exhibits a transition between a connected and a disconnected support for a certain value of $k$, which has no equivalent in the case of Brownian particles. Analyzing in detail the expression of the stationary density in the two cases, we find a variety of regimes characterized by different behaviors near the edges of the support and around $x=0$. Furthermore, we find that the mapping $k_0\to k$ becomes multi-valued below a certain value of the tumbling rate $\gamma$ of the RTPs for some range of values of $k_0$ near the transition, implying the existence of two stable solutions. Finally, we show that in the case of a disconnected support, it is possible to observe steady states where the density $\rho_s(x)$ is not symmetric. All our analytical predictions are in good agreement with numerical simulations already for systems of $N = 100$ particles. The non-uniqueness of the stationary state is a particular feature of this model in the presence of active (RTP) noise, which contrasts with the uniqueness of the Gibbs equilibrium for Brownian particles. We argue that these results are also relevant for a class of more realistic interactions with both an attractive and a repulsive part, but which decay at infinity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.