Related papers: Approximation of exit times for one-dimensional li…
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm so-called Walk on Moving Spheres was already introduced in the Brownian context. The aim is…
The simulation of exit times for diffusion processes is a challenging task since it concerns many applications in different fields like mathematical finance, neuroscience, reliability... The usual procedure is to use discretiza-tion schemes…
This paper develops a new technique for the path approximation of one-dimensional stochastic processes, more precisely the Brownian motion and families of stochastic differential equations sharply linked to the Brownian motion (usually…
In order to describe or estimate different quantities related to a specific random variable, it is of prime interest to numerically generate such a variate. In specific situations, the exact generation of random variables might be either…
Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations…
Continuous-time stochastic processes play an important role in the description of random phenomena, it is therefore of prime interest to study particular variables depending on their paths, like stopping time for example. One approach…
For certain materials science scenarios arising in rubber technology, one-dimensional moving boundary problems (MBPs) with kinetic boundary conditions are capable of unveiling the large-time behavior of the diffusants penetration front,…
The distribution of exit times is computed for a Brownian particle in spherically symmetric two- dimensional domains (disks, angular sectors, annuli) and in rectangles that contain an exit on their boundary. The governing partial…
The drawdown process of an one-dimensional regular diffusion process $X$ is given by $X$ reflected at its running maximum. The drawup process is given by $X$ reflected at its running minimum. We calculate the probability that a drawdown…
We propose an approach to compute the boundary crossing probabilities for a class of diffusion processes which can be expressed as piecewise monotone (not necessarily one-to-one) functionals of a standard Brownian motion. This class…
We establish general moment estimates for the discrete and continuous exit times of a general It\^o process in terms of the distance to the boundary. These estimates serve as intermediate steps to obtain strong convergence results for the…
We consider a bivariate diffusion process and we study the first passage time of one component through a boundary. We prove that its probability density is the unique solution of a new integral equation and we propose a numerical algorithm…
In line with the methodology introduced in our recent article for formulating probabilistic representations of integration by parts involving killed diffusion, we establish an integration by parts formula for the first exit time of…
We extend the ideas of (Barbour 1990) and use Stein's method to obtain a bound on the distance between a scaled time-changed random walk and a time-changed Brownian Motion. We then apply this result to bound the distance between a…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
Low-dimensional periodic arrays of scatterers with a moving point particle are ideal models for studying deterministic diffusion. For such systems the diffusion coefficient is typically an irregular function under variation of a control…
We investigate three different methods for systematically approximating the diffusion coefficient of a deterministic random walk on the line which contains dynamical correlations that change irregularly under parameter variation. Capturing…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…