Resetting by rescaling: exact results for a diffusing particle in one-dimension
Marco Biroli, Yannick Feld, Alexander K. Hartmann, Satya N. Majumdar,, Gregory Schehr

TL;DR
This paper analyzes a one-dimensional diffusive particle with stochastic resetting involving rescaling of position, deriving exact stationary distributions and mean first-passage times, revealing that negative rescaling accelerates target search.
Contribution
The study provides exact solutions for the stationary distribution and MFPT in a rescaling resetting model, highlighting the benefits of negative rescaling for search efficiency.
Findings
Stationary distribution is Gaussian near the peak and exponentially decays for large |x|.
MFPT has a minimum at an optimal resetting rate for all -1<a<1.
Negative rescaling improves search efficiency compared to standard resetting.
Abstract
In this paper, we study a simple model of a diffusive particle on a line, undergoing a stochastic resetting with rate , via rescaling its current position by a factor , which can be either positive or negative. For , the position distribution becomes stationary at long times and we compute this limiting distribution exactly for all . This symmetric distribution has a Gaussian shape near its peak at , but decays exponentially for large . We also studied the mean first-passage time (MFPT) to a target located at a distance from the initial position (the origin) of the particle. As a function of the initial position , the MFPT satisfies a nonlocal second order differential equation and we have solved it explicitly for . For , we also solved it analytically but up to a constant factor whose value can be…
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
TopicsDiffusion and Search Dynamics
