2000 character limit reached
On first exit times and their means for Brownian bridges
Published 16 Nov 2017 in math.PR | (1711.06107v1)
Abstract: For a Brownian bridge from $0$ to $y$ we prove that the mean of the first exit time from interval $(-h,h), \,\, h>0,$ behaves as $O(h2)$ when $h \downarrow 0.$ Similar behavior is seen to hold also for the 3-dimensional Bessel bridge. For Brownian bridge and 3-dimensional Bessel bridge this mean of the first exit time has a puzzling representation in terms of the Kolmogorov distribution. The result regarding the Brownian bridge is applied to prove in detail an estimate needed by Walsh to determine the convergence of the binomial tree scheme for European options.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.