SearcharxivSearch

arXiv · 2009.02116

Approximation of stochastic integrals with jumps via weighted BMO approach

Abstract

This article investigates discrete-time approximations of stochastic integrals driven by semimartingales with jumps via weighted bounded mean oscillation (BMO) approach. This approach enables $L_p$-estimates, $p \in (2, \infty)$, for the approximation error depending on the weight, and it allows a change of the underlying measure which leaves the error estimates unchanged. To take advantage of this approach, we propose a new approximation scheme obtained from a correction for the Riemann approximation based on tracking jumps of the underlying semimartingale. We also discuss a way to optimize the approximation rate by adapting the discretization times to the setting. When the small jump activity of the semimartingale behaves like an $α$-stable process with $α\in (1, 2)$, our scheme achieves under a regular regime the same convergence rate for the error as in Rosenbaum and Tankov [\textit{Ann. Appl. Probab.} \textbf{24} (2014) 1002--1048]. Moreover, our approach extends to the case $α\in (0, 1]$ and to the $L_p$-setting which are not treated there. As an application, we apply the methods in the special case where the semimartingale is an exponential Lévy process to mean-variance hedging of European type options.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nguyen Tran Thuan. 2021-12-13. Approximation of stochastic integrals with jumps via weighted BMO approach. https://arxiv.org/abs/2009.02116

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