SearcharxivSearch

arXiv · 2411.06827

The Exponential Lie Series and a Chen-Strichartz Formula for Levy Processes

Abstract

In this paper, we derive a Chen-Strichartz formula for stochastic differential equations driven by Levy processes, that is, we derive a series expansion of the logarithm of the flowmap of the stochastic differential equation in terms of commutators of vector fields with stochastic coefficients, and we provide an explicit formula for the components in this series. The stochastic components are generated by the Levy processes that drive the stochastic differential equation and their quadratic variation and power jumps; the vector fields are given as linear combinations of commutators of elements in the pre-Lie Magnus expansion generated by the original vector fields governing our stochastic differential equation. In particular, we show the logarithm of the flowmap is a Lie series. These results extend previous results for deterministic differential equations and continuous stochastic differential equations. For these, the Chen-Strichartz series has shown to play a pivotal role in the design of numerical integration schemes that preserve qualitative properties of the solution such as the construction of geometric numerical schemes and in the context of efficient numerical schemes.

Explore related subjects

Keep this discovery

BibTeXRIS

Kurusch Ebrahimi-Fard, Frederic Patras, Anke Wiese. 2024-11-11. The Exponential Lie Series and a Chen-Strichartz Formula for Levy Processes. https://arxiv.org/abs/2411.06827

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