Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 1 h ago
PreprintarXiv licencearXiv

Optimal Evasion from a Resetting Searcher

Abstract

Returning to a familiar location can help a searcher find its target---but how should the target move to avoid being found? We address this question for a resetting Brownian searcher and a mobile target fluctuating around a home location. Keeping the target's typical exploration range fixed, we find that the mean capture time is maximized at an intermediate correlation time: rapid motion promotes encounters, whereas slow motion leaves the target effectively stationary. Between these extremes, persistent excursions away from the searcher's reset point can substantially delay capture. Analytical limiting results explain this optimum, while numerical solutions reveal an approximately linear relation between the maximal mean capture time and the optimal correlation time across many decades. These findings identify temporal correlations as a resource for evasion, allowing a target to prolong survival by changing how it moves rather than where it roams.

Related

  1. Rank-dependent optimal resetting in multiparticle search
    Ron Vatash, Eden Goldfarb, Vladimir Yu. Rudyak +1
    arXivPreprintCC BY 4.0Full textCondensed matterStatistical & nonlinear physicsarXiv
  2. Generating pairwise entanglement in periodically driven quantum spin chains with stochastic resetting
    Sinchan Ghosh, Manas Kulkarni, K. Sengupta +1
    Physical Review BPeer-reviewedLicence not statedAtomic, molecular & optical physicsHAL
  3. Stochastic Orders of the Exit Pair and the Monotone Response to Resetting
    Tony Newton, Juan Antonio Vega Coso
    arXivPreprintarXiv licenceFull textProbabilityStatistical & nonlinear physicsarXiv
  4. Approach to Steady-State in Nested Resetting Processes
    Callum Britton, Ben Le Jeune, Henry Alston +2
    arXivPreprintCC BY 4.0Full textStatistical & nonlinear physicsarXiv
  5. Resetting a Superconducting Qubit with a Compact Colder Resistive Dissipator below the Qubit Frequency
    Jiajia Tian, Meiling Li, Weijie Sun +7
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{taitelbaum2026optimal,
  title = {{Optimal Evasion from a Resetting Searcher}},
  author = {Ami Taitelbaum and Matan Shporer and Shlomi Reuveni and Michael Assaf},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.28126},
  eprint = {2609.28126},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.28126},
}
RIS
TY  - UNPB
TI  - Optimal Evasion from a Resetting Searcher
AU  - Ami Taitelbaum
AU  - Matan Shporer
AU  - Shlomi Reuveni
AU  - Michael Assaf
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.28126
UR  - https://arxiv.org/abs/2609.28126
AB  - Returning to a familiar location can help a searcher find its target---but how should the target move to avoid being found? We address this question for a resetting Brownian searcher and a mobile target fluctuating around a home location. Keeping the target's typical exploration range fixed, we find that the mean capture time is maximized at an intermediate correlation time: rapid motion promotes encounters, whereas slow motion leaves the target effectively stationary. Between these extremes, persistent excursions away from the searcher's reset point can substantially delay capture. Analytical limiting results explain this optimum, while numerical solutions reveal an approximately linear relation between the maximal mean capture time and the optimal correlation time across many decades. These findings identify temporal correlations as a resource for evasion, allowing a target to prolong survival by changing how it moves rather than where it roams.
ER  -