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

Optimal Resetting Brownian Bridges

Benjamin De Bruyne, Satya N. Majumdar, Gregory Schehr

英文摘要:

We introduce a resetting Brownian bridge as a simple model to study search processes where the total search time $t_f$ is finite and the searcher returns to its starting point at $t_f$. This is simply a Brownian motion with a Poissonian resetting rate $r$ to the origin which is constrained to start and end at the origin at time $t_f$. We first provide a rejection-free algorithm to generate such resetting bridges in all dimensions by deriving an effective Langevin equation with an explicit space-time dependent drift $\tilde μ({\bf x},t)$ and resetting rate $\tilde r({\bf x}, t)$. We also study the efficiency of the search process in one-dimension by computing exactly various observables such as the mean-square displacement, the hitting probability of a fixed target and the expected maximum. Surprisingly, we find that there exists an optimal resetting rate $r^*$ that maximizes the search efficiency, even in the presence of a bridge constraint. We show however that the physical mechanism responsible for this optimal resetting rate for bridges is entirely different from resetting Brownian motions without the bridge constraint.

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

↑