SearcharxivSearch

arXiv · 1709.01614

Crank-Nicolson scheme for stochastic differential equations driven by fractional Brownian motions

Abstract

We study the Crank-Nicolson scheme for stochastic differential equations (SDEs) driven by multidimensional fractional Brownian motion $(B^{1}, \dots, B^{m})$ with Hurst parameter $H \in (\frac 12,1)$. It is well-known that for ordinary differential equations with proper conditions on the regularity of the coefficients, the Crank-Nicolson scheme achieves a convergence rate of $n^{-2}$, regardless of the dimension. In this paper we show that, due to the interactions between the driving processes $ B^{1}, \dots, B^{m} $, the corresponding Crank-Nicolson scheme for $m$-dimensional SDEs has a slower rate than for the one-dimensional SDEs. Precisely, we shall prove that when $m=1$ and when the drift term is zero, the Crank-Nicolson scheme achieves the exact convergence rate $n^{-2H}$, while in the case $m=1$ and the drift term is non-zero, the exact rate turns out to be $n^{-\frac12 -H}$. In the general case when $m>1$, the exact rate equals $n^{\frac12 -2H}$. In all these cases the limiting distribution of the leading error is proved to satisfy some linear SDE driven by Brownian motions independent of the given fractional Brownian motions.

Explore related subjects

Keep this discovery

BibTeXRIS

Yaozhong Hu, Yanghui Liu, David Nualart. 2017-09-05. Crank-Nicolson scheme for stochastic differential equations driven by fractional Brownian motions. https://arxiv.org/abs/1709.01614

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