Statistics of first-passage Brownian functionals

Abstract

We study the distribution of first-passage functionals A= ∫0tf xn(t)\, dt, where x(t) is a Brownian motion (with or without drift) with diffusion constant D, starting at x0>0, and tf is the first-passage time to the origin. In the driftless case, we compute exactly, for all n>-2, the probability density Pn(A|x0)=Prob.(A=A). This probability density has an essential singular tail as A 0 and a power-law tail A-(n+3)/(n+2) as A ∞. The former is reproduced by the optimal fluctuation method (OFM), which also predicts the optimal paths of the conditioned process for small A. For the case with a drift toward the origin, where no exact solution is known for general n>-1, the OFM predicts the distribution tails. For A 0 it predicts the same essential singular tail as in the driftless case. For A ∞ it predicts a stretched exponential tail - Pn(A|x0) A1/(n+1) for all n>0. In the limit of large P\'eclet number Pe= μ x0/(2D) 1, where μ is the drift velocity, the OFM predicts a large-deviation scaling for all A: - Pn(A|x0)\, n(z= A/A), where A=x0n+1/μ(n+1) is the mean value of A. We compute the rate function n(z) analytically for all n>-1. For n>0 n(z) is analytic for all z, but for -1<n<0 it is non-analytic at z=1, implying a dynamical phase transition. The order of this transition is 2 for -1/2<n<0, while for -1<n<-1/2 the order of transition changes continuously with n. Finally, we apply the OFM to the case of μ<0 (drift away from the origin). We show that, when the process is conditioned on reaching the origin, the distribution of A coincides with the distribution of A for μ>0 with the same |μ|.

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…