arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.09390cond-mat.stat-mech
收藏

重启条件下竞争的随机搜索者

Competing random searchers under restarts

R. K. Singh, R. Metzler, T. Sandev

AI总结:

本文研究重启对竞争随机搜索者的影响,表明全局重启会放大搜索概率差异,而子系统重启会使搜索概率和平均搜索时间随重启率非单调变化。

摘要:

我们研究了在重启条件下相互独立、争夺同一目标的搜索者,发现引入重启往往会提升本已高效的搜索者的搜索效率。因此,当系统受到重启作用时,各个搜索者的搜索概率之间的差异会增大。这一结果与单个搜索者的身份或重启时间分布的具体细节无关。然而,当一对搜索者中只有一个受到重启作用,而另一个以不受扰动的方式演化时——这一概念被称为子系统重启——我们发现搜索概率对重启率表现出非单调依赖。我们还研究了一对 run and tumble(奔跑翻滚)搜索者与 Brownian(布朗)搜索者在仅 run and tumble 粒子受到重启时的平均搜索时间。我们发现,与重启整个系统的情形类似,平均搜索时间对重启率表现出非单调依赖。

英文摘要:

We study 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑