Abstract
We consider the directed intermittent search for one or more targets in a one-dimensional domain with stochastic resetting. A particle (searcher) randomly switches between a stationary search phase and a rightward moving ballistic phase. The particle can detect a target at some fixed rate whenever it is within range of the target and is in the stationary state. In the absence of resetting, there is a nonzero probability of failure. We calculate the hitting (detection) probability and conditional mean first passage time (MFPT) with and without resetting, for both a single target and a pair of competing targets. We also present an alternative probabilistic method for taking into account the effects of resetting, which is based on conditional expectations, stopping times and an application of the strong Markov property. Such an approach has previously been used to analyze diffusion processes in randomly switching environments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
