arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1503.02013cond-mat.stat-mech
收藏

时空耦合有限寿命随机游动系统的最优搜索策略

Optimal search strategies of space-time coupled random walkers with finite lifetimes

D. Campos, E. Abad, V. Méndez, S. B. Yuste, K. Lindenberg

摘要:

我们提出了一个简单的范式检测一个固定的目标的时空耦合随机步行者与有限的寿命。步行机的运动的特征在于以固定速度的线性位移和指数分布的持续时间,被运动方向的随机变化中断,并以相同的速度在新的方向上恢复运动。我们称这些行尸为“凡人爬虫”。一个致命的爬行动物可能会在其运动过程中的任何时候死亡,根据指数衰减规律,其特征是有限的平均死亡率$ω_m$。当爬行动物还活着时,其运动方向的改变具有有限的平均频率$ω$。特别是,我们考虑的目标搜索过程的效率,其特征在于爬行动物最终将检测到目标的概率。数值结果证实了分析结果表明,存在一个依赖于$ω_m$的最佳频率$ω=ω_{opt}$,使最终目标检测的概率最大化。我们的工作主要是在一维($d=1$)域,并检查初始条件和有限域大小的作用。在$d=2$域的数值结果证实存在一个最佳的频率的方向变化,从而表明所观察到的效果是强大的维数变化。在$d=1$情况下,给出了长时间内目标检测概率的显式表达式。在一个无限域的情况下,我们计算检测概率为任意时间,并研究其早期和后期的时间行为。我们进一步考虑的生存概率的存在下,许多独立的爬行动物开始在同一位置,在同一时间的运动的目标。我们还考虑了一个版本的标准的“目标问题”,其中许多爬行动物开始在随机位置在同一时间。

英文摘要:

We present a simple paradigm for detection of an immobile target by a space-time coupled random walker with a finite lifetime. The motion of the walker is characterized by linear displacements at a fixed speed and exponentially distributed duration, interrupted by random changes in the direction of motion and resumption of motion in the new direction with the same speed. We call these walkers "mortal creepers". A mortal creeper may die at any time during its motion according to an exponential decay law characterized by a finite mean death rate $ω_m$. While still alive, the creeper has a finite mean frequency $ω$ of change of the direction of motion. In particular, we consider the efficiency of the target search process, characterized by the probability that the creeper will eventually detect the target. Analytic results confirmed by numerical results show that there is an $ω_m$-dependent optimal frequency $ω=ω_{opt}$ that maximizes the probability of eventual target detection. We work primarily in one-dimensional ($d=1$) domains and examine the role of initial conditions and of finite domain sizes. Numerical results in $d=2$ domains confirm the existence of an optimal frequency of change of direction, thereby suggesting that the observed effects are robust to changes in dimensionality. In the $d=1$ case, explicit expressions for the probability of target detection in the long time limit are given. In the case of an infinite domain, we compute the detection probability for arbitrary times and study its early- and late-time behavior. We further consider the survival probability of the target in the presence of many independent creepers beginning their motion at the same location and at the same time. We also consider a version of the standard "target problem" in which many creepers start at random locations at the same time.

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

↑