2017
DOI: 10.1088/1751-8121/aa6769
|View full text |Cite
|
Sign up to set email alerts
|

Optimal potentials for diffusive search strategies

Abstract: We consider one dimensional diffusive search strategies subjected to external potentials. The location of a single target is drawn from a given probability density function (PDF) f G (x) and is fixed for each stochastic realization of the process. We optimize the quality of the search strategy as measured by the mean first passage time (MFPT) to the position of the target. For a symmetric but otherwise arbitrary distribution f G (x) we find the optimal potential that minimizes the MFPT. The minimal MFPT is giv… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(17 citation statements)
references
References 72 publications
0
17
0
Order By: Relevance
“…In [81] target distributions were considered and the optimal potential for a Langevin process (without resetting) for a given target distribution was computed exactly. The mean time to absorption was then compared to that of resetting with a constant rate r * optimised for the target distribution.…”
Section: Optimal Resettingmentioning
confidence: 99%
“…In [81] target distributions were considered and the optimal potential for a Langevin process (without resetting) for a given target distribution was computed exactly. The mean time to absorption was then compared to that of resetting with a constant rate r * optimised for the target distribution.…”
Section: Optimal Resettingmentioning
confidence: 99%
“…Aside from the optimal rate of resetting, there exists a certain exponent present in the power-law distribution of waiting times between resets which in the case of an ordinarily diffusing particle minimizes its mean first-passage time to a given target position [50]. The first-passage problem under stochastic resetting has also been studied in a presence of various external potentials [72,21,73], in bounded domains [74,75] and under restart with branching [76].…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the searcher is a Markov diffusion process generated by the operator L = D Our aim is to minimize this expected search time over all admissible drifts b ∈ D µ . We note that this same problem was recently considered in the physics literature [5]; for more on this, see Remark 1 after Theorem 2.…”
Section: Introduction and Statement Of Resultsmentioning
confidence: 75%