SearcharxivSearch

arXiv · 1502.05034

Continuous-time Random Walks for the Numerical Solution of Stochastic Differential Equations

Abstract

This paper introduces time-continuous numerical schemes to simulate stochastic differential equations (SDEs) arising in mathematical finance, population dynamics, chemical kinetics, epidemiology, biophysics, and polymeric fluids. These schemes are obtained by spatially discretizing the Kolmogorov equation associated with the SDE in such a way that the resulting semi-discrete equation generates a Markov jump process that can be realized exactly using a Monte Carlo method. In this construction the spatial increment of the approximation can be bounded uniformly in space, which guarantees that the schemes are numerically stable for both finite and long time simulation of SDEs. By directly analyzing the generator of the approximation, we prove that the approximation has a sharp stochastic Lyapunov function when applied to an SDE with a drift field that is locally Lipschitz continuous and weakly dissipative. We use this stochastic Lyapunov function to extend a local semimartingale representation of the approximation. This extension permits to analyze the complexity of the approximation. Using the theory of semigroups of linear operators on Banach spaces, we show that the approximation is (weakly) accurate in representing finite and infinite-time statistics, with an order of accuracy identical to that of its generator. The proofs are carried out in the context of both fixed and variable spatial step sizes. Theoretical and numerical studies confirm these statements, and provide evidence that these schemes have several advantages over standard methods based on time-discretization. In particular, they are accurate, eliminate nonphysical moves in simulating SDEs with boundaries (or confined domains), prevent exploding trajectories from occurring when simulating stiff SDEs, and solve first exit problems without time-interpolation errors.

Explore related subjects

Keep this discovery

BibTeXRIS

Nawaf Bou-Rabee, Eric Vanden-Eijnden. 2015-02-17. Continuous-time Random Walks for the Numerical Solution of Stochastic Differential Equations. https://arxiv.org/abs/1502.05034

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR