SearcharxivSearch

arXiv · 0709.2434

A new weak approximation scheme of stochastic differential equations and the Runge-Kutta method

Abstract

In this paper, authors successfully construct a new algorithm for the new higher order scheme of weak approximation of SDEs. The algorithm presented here is based on [1][2]. Although this algorithm shares some features with the algorithm presented by [3], algorithms themselves are completely different and the diversity is not trivial. They apply this new algorithm to the problem of pricing Asian options under the Heston stochastic volatility model and obtain encouraging results. [1] Shigeo Kusuoka, "Approximation of Expectation of Diffusion Process and Mathematical Finance," Advanced Studies in Pure Mathematics, Proceedings of Final Taniguchi Symposium, Nara 1998 (T. Sunada, ed.), vol. 31 2001, pp. 147--165. [2] Terry Lyons and Nicolas Victoir, "Cubature on Wiener Space," Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences 460 (2004), pp. 169--198. [3] Syoiti Ninomiya, Nicolas Victoir, "Weak approximation of stochastic differential equations and application to derivative pricing," Applied Mathematical Finance, Volume 15, Issue 2 April 2008, pages 107--121

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mariko Ninomiya, Syoiti Ninomiya. 2007-09-15. A new weak approximation scheme of stochastic differential equations and the Runge-Kutta method. https://doi.org/10.1007/s00780-009-0101-4

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