9,099 research outputs found

    Distribution of the time at which the deviation of a Brownian motion is maximum before its first-passage time

    Full text link
    We calculate analytically the probability density P(tm)P(t_m) of the time tmt_m at which a continuous-time Brownian motion (with and without drift) attains its maximum before passing through the origin for the first time. We also compute the joint probability density P(M,tm)P(M,t_m) of the maximum MM and tmt_m. In the driftless case, we find that P(tm)P(t_m) has power-law tails: P(tm)∼tm−3/2P(t_m)\sim t_m^{-3/2} for large tmt_m and P(tm)∼tm−1/2P(t_m)\sim t_m^{-1/2} for small tmt_m. In presence of a drift towards the origin, P(tm)P(t_m) decays exponentially for large tmt_m. The results from numerical simulations are in excellent agreement with our analytical predictions.Comment: 13 pages, 5 figures. Published in Journal of Statistical Mechanics: Theory and Experiment (J. Stat. Mech. (2007) P10008, doi:10.1088/1742-5468/2007/10/P10008

    Levy--Brownian motion on finite intervals: Mean first passage time analysis

    Full text link
    We present the analysis of the first passage time problem on a finite interval for the generalized Wiener process that is driven by L\'evy stable noises. The complexity of the first passage time statistics (mean first passage time, cumulative first passage time distribution) is elucidated together with a discussion of the proper setup of corresponding boundary conditions that correctly yield the statistics of first passages for these non-Gaussian noises. The validity of the method is tested numerically and compared against analytical formulae when the stability index α\alpha approaches 2, recovering in this limit the standard results for the Fokker-Planck dynamics driven by Gaussian white noise.Comment: 9 pages, 13 figure

    Estimating expected first passage times using multilevel Monte Carlo algorithm

    Get PDF
    In this paper we devise a method of numerically estimating the expected first passage times of stochastic processes. We use Monte Carlo path simulations with Milstein discretisation scheme to approximate the solutions of scalar stochastic differential equations. To further reduce the variance of the estimated expected stopping time and improve computational efficiency, we use the multi-level Monte Carlo algorithm, recently developed by Giles (2008a), and other variance-reduction techniques. Our numerical results show significant improvements over conventional Monte Carlo techniques

    Efficient estimation of one-dimensional diffusion first passage time densities via Monte Carlo simulation

    Full text link
    We propose a method for estimating first passage time densities of one-dimensional diffusions via Monte Carlo simulation. Our approach involves a representation of the first passage time density as expectation of a functional of the three-dimensional Brownian bridge. As the latter process can be simulated exactly, our method leads to almost unbiased estimators. Furthermore, since the density is estimated directly, a convergence of order 1/N1 / \sqrt{N}, where NN is the sample size, is achieved, the last being in sharp contrast to the slower non-parametric rates achieved by kernel smoothing of cumulative distribution functions.Comment: 14 pages, 2 figure
    • …
    corecore