SearcharxivSearch

arXiv · 1612.05541

Approximation and simulation of infinite-dimensional Levy processes

Abstract

In this paper approximation methods for infinite-dimensional Levy processes, also called (time-dependent) Levy fields, are introduced. For square integrable fields beyond the Gaussian case, it is no longer given that the one-dimensional distributions in the spectral representation with respect to the covariance operator are independent. When simulated via a Karhunen-Loeve expansion a set of dependent but uncorrelated one-dimensional Levy processes has to be generated. The dependence structure among the one-dimensional processes ensures that the resulting field exhibits the correct point-wise marginal distributions. To approximate the respective (one-dimensional) Levy-measures, a numerical method, called discrete Fourier inversion, is developed. For this method, $L^p$-convergence rates can be obtained and, under certain regularity assumptions, mean square and $L^p$-convergence of the approximated field is proved. Further, a class of (time-dependent) Levy fields is introduced, where the point-wise marginal distributions are dependent but uncorrelated subordinated Wiener processes. For this specific class one may derive point-wise marginal distributions in closed form. Numerical examples, which include hyperbolic and normal-inverse Gaussian fields, demonstrate the efficiency of the approach.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Barth, Andreas Stein. 2016-12-16. Approximation and simulation of infinite-dimensional Levy processes. https://arxiv.org/abs/1612.05541

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