We study a pair of independent searchers competing for a target under restarts and find that introduction of restarts tends to enhance the search efficiency of an already efficient searcher. As a result, the difference between the search probabilities of the individual searchers increases when the system is subject to restarts. This result holds true independent of the identity of individual searchers or the specific details of the distribution of restart times. However, when only one of a pair of searchers is subject to restarts while the other evolves in an unperturbed manner, a concept termed as subsystem restarts, we find that the search probability exhibits a nonmonotonic dependence on the restart rate. We also study the mean search time for a pair of run and tumble and Brownian searchers when only the run and tumble particle is subject to restarts. We find that, analogous to restarting the whole system, the mean search time exhibits a nonmonotonic dependence on restart rates.
Skip Nav Destination
Bernoulli trial under subsystem restarts: Two competing searchers looking for a target
,
,
Article navigation
January 2025
Research Article|
January 16 2025
Bernoulli trial under subsystem restarts: Two competing searchers looking for a target
Special Collection:
Anomalous Diffusion and Fluctuations in Complex Systems and Networks
R. K. Singh
;
R. K. Singh
a)
(Conceptualization, Formal analysis, Investigation, Methodology, Software, Visualization, Writing – original draft, Writing – review & editing)
1
Department of Biomedical Engineering, Ben-Gurion University of the Negev
, Be’er Sheva 85105, Israel
a)Author to whom correspondence should be addressed: [email protected]
Search for other works by this author on:
R. Metzler
;
R. Metzler
(Conceptualization, Investigation, Writing – review & editing)
2
Institute of Physics and Astronomy, University of Potsdam
, D-14476 Potsdam-Golm, Germany
3
Asia Pacific Center for Theoretical Physics
, Pohang 37673, Republic of Korea
Search for other works by this author on:
T. Sandev
T. Sandev
(Conceptualization, Investigation, Writing – review & editing)
4
Research Center for Computer Science and Information Technologies, Macedonian Academy of Sciences and Arts
, Bul. Krste Misirkov 2, 1000 Skopje, Macedonia
5
Institute of Physics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University
, Arhimedova 3, 1000 Skopje, Macedonia
6
Department of Physics, Korea University
, Seoul 02841, Republic of Korea
Search for other works by this author on:
R. K. Singh
1,a)
R. Metzler
2,3
T. Sandev
4,5,6
1
Department of Biomedical Engineering, Ben-Gurion University of the Negev
, Be’er Sheva 85105, Israel
2
Institute of Physics and Astronomy, University of Potsdam
, D-14476 Potsdam-Golm, Germany
3
Asia Pacific Center for Theoretical Physics
, Pohang 37673, Republic of Korea
4
Research Center for Computer Science and Information Technologies, Macedonian Academy of Sciences and Arts
, Bul. Krste Misirkov 2, 1000 Skopje, Macedonia
5
Institute of Physics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University
, Arhimedova 3, 1000 Skopje, Macedonia
6
Department of Physics, Korea University
, Seoul 02841, Republic of Korea
a)Author to whom correspondence should be addressed: [email protected]
Chaos 35, 011103 (2025)
Article history
Received:
September 10 2024
Accepted:
December 29 2024
Citation
R. K. Singh, R. Metzler, T. Sandev; Bernoulli trial under subsystem restarts: Two competing searchers looking for a target. Chaos 1 January 2025; 35 (1): 011103. https://doi.org/10.1063/5.0238201
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Citing articles via
Introduction to Focus Issue: Data-driven models and analysis of complex systems
Johann H. Martínez, Klaus Lehnertz, et al.
Sex, ducks, and rock “n” roll: Mathematical model of sexual response
K. B. Blyuss, Y. N. Kyrychko
Selecting embedding delays: An overview of embedding techniques and a new method using persistent homology
Eugene Tan, Shannon Algar, et al.
Related Content
Predicting search time when hunting for multiple moving targets: A recursive harmonic law
Chaos (August 2018)
Intermittent search process and teleportation
J. Chem. Phys. (June 2007)
Optimal conditions for first passage of jump processes with resetting
Chaos (February 2025)
The influences of correlated spatially random perturbations on first passage time in a linear-cubic potential
Chaos (October 2019)
Network analysis based on large deviation statistics
AIP Conf. Proc. (July 2007)