SearcharxivSearch

arXiv · 1203.0866

Sobolev index: A classification of L\'evy processes

Abstract

We classify L\'evy processes according to the solution spaces of the associated parabolic PIDEs. This classification reveals structural characteristics of the processes and is relevant for applications such as for solving PIDEs numerically for pricing options in L\'evy models. The classification is done via the Fourier transform i.e. via the symbol of the process. We define the Sobolev index of a L\'evy process by a certain growth condition on the symbol. It follows that for L\'evy processes with Sobolev index $\alpha$ the corresponding evolution problem has a unique weak solution in the Sobolev-Slobodeckii space $H^{\alpha/2}$. We show that this classification applies to a wide range of processes. Examples are the Brownian motion with or without drift, generalised hyperbolic (GH), CGMY and (semi) stable L\'evy processes. A comparison of the Sobolev index with the Blumenthal-Getoor index sheds light on the structural implication of the classification. More precisely, we discuss the Sobolev index as an indicator of the smoothness of the distribution and of the variation of the paths of the process. This highlights the relation between the $p$-variation of the paths and the degree of smoothing effect that stems from the distribution.

Explore related subjects

Keep this discovery

BibTeXRIS

Kathrin Glau. 2012-03-05. Sobolev index: A classification of L\'evy processes. https://arxiv.org/abs/1203.0866

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