We study the dynamics of an overdamped Brownian particle subjected to Poissonian stochastic resetting in a nonthermal bath, characterized by a Poisson white noise and a Gaussian noise. Applying the renewal theory we find an exact analytical expression for the spatial distribution at the steady state. Unlike the single exponential distribution as observed in the case of a purely thermal bath, the distribution is double exponential. Relaxation of the transient spatial distributions to the stationary one, for the limiting cases of Poissonian rate, is investigated carefully. In addition, we study the first-arrival properties of the system in the presence of a delta-function sink with strength $κ$, where $κ=0$ and $κ=\infty$ correspond to fully nonreactive and fully reactive sinks, respectively. We explore the effect of two competitive mechanisms: the diffusive spread in the presence of two noises and the increase in probability density around the initial position due to stochastic resetting. We show that there exists an optimal resetting rate, which minimizes the mean first-arrival time (MFAT) to the sink for a given value of the sink strength. We also explore the effect of the strength of the Poissonian noise on MFAT, in addition to sink strength. Our formalism generalizes the diffusion-limited reaction under resetting in a nonequilibrium bath and provides an efficient search strategy for a reactant to find a target site, relevant in a range of biophysical processes.
We study experimentally and theoretically the optimal mean time needed by a free diffusing Brownian particle to reach a target at a distance L from an initial position in the presence of resetting. Both the initial position and the resetting position are Gaussian distributed with width $σ$. We derived and tested two resetting protocols, one with a periodic and one with random (Poissonian) resetting times. We computed and measured the full first-passage probability distribution that displays spectacular spikes immediately after each resetting time for close targets. We study the optimal mean fi…
Rank-dependent optimal resetting in multiparticle search
The Raymond and Beverley School of Chemistry, Tel Aviv University（特拉维夫大学雷蒙德和贝弗利化学学院）；The Raymond and Beverley School of Physics & Astronomy, Tel Aviv University（特拉维夫大学雷蒙德和贝弗利物理与天文学院）
We consider diffusive motion of a particle performing a random walk with Lévy distributed jump lengths and subject to resetting mechanism bringing the walker to an initial position at uniformly distributed times. In the limit of infinite number of steps and for long times, the process converges to a super-diffusive motion with replenishment. We derive formula for a mean first arrival time (MFAT) to a predefined target position reached by a meandering particle and analyze efficiency of the proposed searching strategy by investigating criteria for an optimal (a shortest possible) MFAT.
The model of binary aggregation with constant kernel is subjected to stochastic resetting: aggregates of any size explode into monomers at independent stochastic times. These resetting times are Poisson distributed, and the rate of the process is called the resetting rate. The master equation yields a Bernoulli-type equation in the generating function of the concentration of aggregates of any size, which can be solved exactly. This resetting prescription leads to a non-equilibrium steady state for the densities of aggregates, which is a function of the size of the aggregate, rescaled by a func…
We consider a random walker on a ring, subjected to resetting at Poisson-distributed times to the initial position (the walker takes the shortest path along the ring to the initial position at resetting times). In the case of a Brownian random walker the mean first-completion time of a turn is expressed in closed form as a function of the resetting rate. The value is shorter than in the ordinary process if the resetting rate is low enough. Moreover, the mean first-completion time of a turn can be minimised in the resetting rate. At large time the distribution of winding numbers does not reach …
What determines the average length of a queue which stretches in front of a service station? The answer to this question clearly depends on the average rate at which jobs arrive at the queue and on the average rate of service. Somewhat less obvious is the fact that stochastic fluctuations in service and arrival times are also important, and that these are a major source of backlogs and delays. Strategies that could mitigate fluctuations induced delays are in high demand as queue structures appear in various natural and man-made systems. Here we demonstrate that a simple service resetting mecha…
The state of many physical, biological and socio-technical systems evolves by combining smooth local transitions and abrupt resetting events to a set of reference values. The inclusion of the resetting mechanism not only provides the possibility of modeling a wide variety of realistic systems but also leads to interesting novel phenomenology not present in reset-free cases. However, most models where stochastic resetting is studied address the case of a finite number of uncorrelated variables, commonly a single one, such as the position of non-interacting random walkers. Here we overcome this …
