Related papers: Strong approximation of particular one-dimensional…

In this article we show a robustness theorem for controlled stochastic differential equations driven by approximations of Brownian motion. Often, Brownian motion is used as an idealized model of a diffusion where approximations such as…

The signature is a collection of iterated integrals describing the "shape" of a path. It appears naturally in the Taylor expansions of controlled differential equations and, as a consequence, is arguably the central object within rough path…

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…

Density dependent families of Markov chains, such as the stochastic models of mass-action chemical kinetics, converge for large values of the indexing parameter $N$ to deterministic systems of differential equations (Kurtz, 1970). Moreover…

In this paper, we show an approximation in law of the complex Brownian motion by processes constructed from a stochastic process with independent increments. We give sufficient conditions for the characteristic function of the process with…

Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide the approximate solution only…

Strong invariance principles describe the error term of a Brownian approximation of the partial sums of a stochastic process. While these strong approximation results have many applications, the results for continuous-time settings have…

Consider a multidimensional diffusion process $X=\{X\left(t\right) :t\in\lbrack0,1]\}$. Let $\varepsilon>0$ be a \textit{deterministic}, user defined, tolerance error parameter. Under standard regularity conditions on the drift and…

Gradient optimization algorithms using epochs, that is those based on stochastic gradient descent without replacement (SGDo), are predominantly used to train machine learning models in practice. However, the mathematical theory of SGDo and…

In this paper, we study the discrete-time approximation schemes for a class of backward stochastic differential equations driven by $G$-Brownian motion ($G$-BSDEs) which corresponds to the hedging pricing of European contingent claims. By…

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…

This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…

We establish $L^p$-type universal approximation theorems for general and non-anticipative functionals on suitable rough path spaces, showing that linear functionals acting on signatures of time-extended rough paths are dense with respect to…

We study the approximation of stochastic differential equations driven by a fractional Brownian motion with Hurst parameter $H>1/2$. For the mean-square error at a single point we derive the optimal rate of convergence that can be achieved…

We consider a general class of high order weak approximation schemes for stochastic differential equations driven by L\'evy processes with infinite activity. These schemes combine a compound Poisson approximation for the jump part of the…

In this paper we introduce a new method for the simulation of the exit time and position of a $\delta$-dimensional Brownian motion from a domain. The main interest of our method is that it avoids splitting time schemes as well as inversion…

We study well-posedness of sweeping processes with stochastic perturbations generated by a fractional Brownian motion and convergence of associated numerical schemes. To this end, we first prove new existence, uniqueness and approximation…

We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchronization. Specifically, we are given directed distances on a…

In this paper we investigate three discrete or semi-discrete approximation schemes for reflected Brownian motion on bounded Euclidean domains. For a class of bounded domains $D$ in $\mathbb{R}^n$ that includes all bounded Lipschitz domains…

We investigate piecewise-linear stochastic models as with regards to the probability distribution of functionals of the stochastic processes, a question which occurs frequently in large deviation theory. The functionals that we are looking…