Optimizing search processes in systems with state toggling: exact condition delimiting the efficacy of stochastic resetting strategy
Hillol kumar Barman, Amitabha Nandi, Dibyendu Das

TL;DR
This paper derives a mathematical condition for when stochastic resetting enhances search efficiency in systems with environment toggling, revealing complex behaviors like advantage re-entrance depending on potential strength.
Contribution
It provides the first exact condition for the efficacy of resetting in toggling environments and demonstrates re-entrant advantage phenomena in diffusive systems.
Findings
Resetting advantage vanishes at a continuous transition point.
Re-entrance of resetting benefit occurs as potential strength varies.
Exact solutions for diffusive motion in linear potentials are presented.
Abstract
Will the strategy of resetting} help a stochastic process to reach its target efficiently, with its environment continually toggling between a strongly favourable and an unfavourable (or weakly favourable) state? A diffusive run-and-tumble motion, transport of molecular motors on or off a filament, and motion under flashing optical traps are special examples of such state toggling. For any general process with toggling under Poisson reset, we derive a mathematical condition for continuous transitions where the advantage rendered by resetting vanishes. For the case of diffusive motion with linear potentials of unequal strength, we present exact solutions which reveal that there is quite generically a re-entrance of the advantage of resetting as a function of the strength of the strongly favourable potential. This result is shown to be valid for quadratic potential traps by using the…
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 · Optimization and Search Problems
