Maximum Distance Between the Leader and the Laggard for Three Brownian Walkers

Abstract

We consider three independent Brownian walkers moving on a line. The process terminates when the left-most walker (the `Leader') meets either of the other two walkers. For arbitrary values of the diffusion constants D1 (the Leader), D2 and D3 of the three walkers, we compute the probability distribution P(m|y2,y3) of the maximum distance m between the Leader and the current right-most particle (the `Laggard') during the process, where y2 and y3 are the initial distances between the leader and the other two walkers. The result has, for large m, the form P(m|y2,y3) A(y2,y3) m-δ, where δ = (2π-θ)/(π-θ) and θ = cos-1(D1/(D1+D2)(D1+D3). The amplitude A(y2,y3) is also determined exactly.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…