Maximum of N Independent Brownian Walkers till the First Exit From the Half Space

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, 9 figures

Scientific paper

10.1088/1751-8113/43/31/315001

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 $\vec x = (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|\vec x)\sim B_N (x_1x_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 the Laplace's equation in an $N$-dimensional hypercube with some prescribed boundary conditions. The analytical results are in excellent agreement with Monte Carlo simulations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Maximum of N Independent Brownian Walkers till the First Exit From the Half Space does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum of N Independent Brownian Walkers till the First Exit From the Half Space, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum of N Independent Brownian Walkers till the First Exit From the Half Space will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-69018

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.