论文标题

经过重置的Brownian搜索者的最佳平均第一个小说时间:实验和理论结果

Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results

论文作者

Besga, Benjamin, Bovon, Alfred, Petrosyan, Artyom, Majumdar, Satya N., Ciliberto, Sergio

论文摘要

我们从实验和理论上研究了自由扩散的布朗粒子所需的最佳平均时间,以在存在重置的情况下与初始位置的距离达到目标。初始位置和重置位置都是高斯分布,宽度$σ$。我们得出并测试了两个重置协议,一个是定期的,一个带有随机的(泊松式)重置时间。我们计算并测量了完整的第一学期概率分布,该分布在每个重置时间用于接近目标后立即显示出壮观的尖峰。我们研究了比率b = l/$σ$的不同值的重置周期/速率的最佳平均第一学期时间,并在临界值B = BC下找到一个有趣的相位transtion。对于BC <b <$ \ infty $,有一个亚稳态的最佳时间,b <bc会消失。还讨论了实施这些协议在实验中实施这些协议的内在困难。

We study experimentally and theoretically the optimal mean time needed by a free diffusing Brownian particle to reach a target at a distance L from an initial position in the presence of resetting. Both the initial position and the resetting position are Gaussian distributed with width $σ$. We derived and tested two resetting protocols, one with a periodic and one with random (Poissonian) resetting times. We computed and measured the full first-passage probability distribution that displays spectacular spikes immediately after each resetting time for close targets. We study the optimal mean first-passage time as a function of the resetting period/rate for different values of the ratio b = L/$σ$ and find an interesting phase transtion at a critical value b = bc. For bc < b < $\infty$, there is a metastable optimum time which disappears for b < bc. The intrinsic diffculties in implementing these protocols in experiments are also discussed.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源