期刊
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL
卷 43, 期 31, 页码 -出版社
IOP PUBLISHING LTD
DOI: 10.1088/1751-8113/43/31/315001
关键词
-
资金
- NSF [CCF-0829541]
- ANR [09-BLAN-0097-02]
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [829541] Funding Source: National Science Foundation
We consider the one-dimensional target search process that involves an immobile target located at the origin and N searchers performing independent Brownian motions starting at the initial positions (x) over right arrow = (x(1), x(2),..., x(N)), all on the positive half-space. The process stops when the target is first found by one of the searchers. We compute the probability distribution of the maximum distance m visited by the searchers till the stopping time and show that it has a power-law tail: P-N(m|(x) over right arrow) similar or equal to B-N(x(1)x(2) ... x(N))/m(N+1) for large m. Thus, all moments of m up to the order (N - 1) are finite, while the higher moments diverge. The prefactor B-N increases with N faster than exponentially. Our solution gives the exit probability of a set of N particles from a box [ 0, L] through the left boundary. Incidentally, it also provides an exact solution of Laplace's equation in an N-dimensional hypercube with some prescribed boundary conditions. The analytical results are in excellent agreement with Monte Carlo simulations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据