SearcharxivSearch

arXiv · 1508.04581

Strong convergence of the symmetrized Milstein scheme for some CEV-like SDEs

Abstract

In this paper we study the rate of convergence of a symmetrized version of the Milstein scheme applied to the solution of the one dimensional SDE $$X_t = x_0 + \int_{0}^t{b(X_s)ds}+\int_{0}^t{σ|X_s|^αdW_s}, \;x_0>0,\;σ>0,\; α\in[\tfrac{1}{2},1).$$ Assuming $b(0)/σ^2$ big enough, and $b$ smooth, we prove a strong rate of convergence of order one, recovering the classical result of Milstein for SDEs with smooth diffusion coefficient. In contrast with other recent results, our proof does not relies on Lamperti transformation, and it can be applied to a wide class of drift functions. On the downside, our hypothesis on the critical parameter value $b(0)/σ^2$ is more restrictive than others available in the literature. Some numerical experiments and comparison with various other schemes complement our theoretical analysis that also applies for the simple projected Milstein scheme with same convergence rate.

Explore related subjects

Keep this discovery

BibTeXRIS

Mireille Bossy, Hector Olivero Quinteros. 2016-08-19. Strong convergence of the symmetrized Milstein scheme for some CEV-like SDEs. https://doi.org/10.3150/16-bej918

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