Maximum of<i>N</i>independent Brownian walkers till the first exit from the half-space
Maximum of<i>N</i>independent Brownian walkers till the first exit from the half-space
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 …