Related papers: Implementable coupling of L\'evy process and Brown…
We study pathwise approximation of scalar stochastic differential equations at a single point. We provide the exact rate of convergence of the minimal errors that can be achieved by arbitrary numerical methods that are based (in a…
This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…
We develop a new Monte Carlo variance reduction method to estimate the expectation of two commonly encountered path-dependent functionals: first-passage times and occupation times of sets. The method is based on a recursive approximation of…
This paper provides a multivariate extension of Bertoin's pathwise construction of a L\'evy process conditioned to stay positive/negative. Thus obtained processes conditioned to stay in half-spaces are closely related to the original…
A new algorithm for the approximation and simulation of twofold iterated stochastic integrals together with the corresponding L\'{e}vy areas driven by a multidimensional Brownian motion is proposed. The algorithm is based on a truncated…
An efficient discrete time and space Markov chain approximation employing a Brownian bridge correction for computing curvilinear boundary crossing probabilities for general diffusion processes was recently proposed in Liang and Borovkov…
An important family of stochastic processes arising in many areas of applied probability is the class of L\'evy processes. Generally, such processes are not simulatable especially for those with infinite activity. In practice, it is common…
We give asymptotic estimations on the area of the sets of points with large Brownian winding, and study the average winding between a planar Brownian motion and a Poisson point process of large intensity on the plane. This allows us to give…
For a general c\`adl\`ag L\'evy process on a separable Banach space $V$ we estimate values of $\inf_{Y\in{\cal A}_X} \mathbb{E}\left\{ \psi\left( \Vert X - Y \Vert_\infty\right) + \mathrm{TV}(Y[0,T]) \right\}$, where ${\cal A}_X$ is the…
The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It is common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention…
In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are…
The question how the extremal values of a stochastic process achieved on different time intervals are correlated to each other has been discussed within the last few years on examples of the running maximum of a Brownian motion, of a…
We present a simple construction method for Feller processes and a framework for the generation of sample paths of Feller processes. The construction is based on state space dependent mixing of L\'evy processes. Brownian Motion is one of…
We propose a discrete time discrete space Markov chain approximation with a Brownian bridge correction for computing curvilinear boundary crossing probabilities of a general diffusion process on a finite time interval. For broad classes of…
An obvious way to simulate a L\'evy process $X$ is to sample its increments over time $1/n$, thus constructing an approximating random walk $X^{(n)}$. This paper considers the error of such approximation after the two-sided reflection map…
We propose a method to exactly generate bridge run-and-tumble trajectories that are constrained to start at the origin with a given velocity and to return to the origin after a fixed time with another given velocity. The method extends the…
We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…
The accuracy of least squares calibration using option premiums and particle filtering of price data to find model parameters is determined. Derivative models using exponential L\'evy processes are calibrated using regularized weighted…
We develop a novel Monte Carlo algorithm for the vector consisting of the supremum, the time at which the supremum is attained and the position at a given (constant) time of an exponentially tempered L\'evy process. The algorithm, based on…
In this paper, we study an approximation scheme for L\'evy processes with drift in terms of a representation that is akin to the celebrated Mehler formula for L\'evy-Ornstein-Uhlenbeck processes. The approximation scheme is based on a…