SearcharxivSearch

arXiv · math/0001018

Path-wise solutions of SDE's driven by Levy processes

Abstract

In this paper we show that a path-wise solution to the following integral equation $$ Y_t = \int_0^t f(Y_t) dX_t \qquad Y_0=a \in \R^d $$ exists under the assumption that X_t is a Lévy process of finite p-variation for some $p \geq1$ and that f is an $α$-Lipschitz function for some alpha>p. There are two types of solution, determined by the solution's behaviour at jump times of the process X, one we call geometric the other forward. The geometric solution is obtained by adding fictitious time and solving an associated integral equation. The forward solution is derived from the geometric solution by correcting the solution's jump behaviour. Lévy processes, generally, have unbounded variation. So we must use a pathwise integral different from the Lebesgue-Stieltjes integral. When X has finite p-variation almost surely for p<2 we use Young's integral. This is defined whenever f and g have finite p and q-variation for 1/p+1/q>1 (and they have no common discontinuities). When p>2 we use the integral of Lyons. In order to use this integral we construct the Lévy area of the Lévy process and show that it has finite (p/2)-variation almost surely.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David R. E. Williams. 2000-01-04. Path-wise solutions of SDE's driven by Levy processes. https://arxiv.org/abs/math/0001018

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