Minimizing the Profligacy of Searches with Reset

John C. Sunil, Richard A. Blythe, Martin R. Evans*, Satya N. Majumdar

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce the profligacy of a search process as a competition between its expected cost and
the probability of finding the target. The arbiter of the competition is a parameter λ that represents how much a searcher invests into increasing the chance of success. Minimizing the profligacy with respect to the search strategy specifies the optimal search. We show that in the case of diffusion with stochastic resetting, the amount of resetting in the optimal strategy has a highly nontrivial dependence on model parameters resulting in classical continuous transitions, discontinuous transitions and tricritical points as well as non-standard discontinuous transitions exhibiting re-entrant behavior and overhangs.
Original languageEnglish
Article number054122
Pages (from-to)1-11
Number of pages11
JournalPhysical Review E
Volume110
Issue number5
DOIs
Publication statusPublished - 18 Nov 2024

Keywords / Materials (for Non-textual outputs)

  • cond-mat.stat-mech

Fingerprint

Dive into the research topics of 'Minimizing the Profligacy of Searches with Reset'. Together they form a unique fingerprint.

Cite this