SearcharxivSearch

arXiv · 1708.02500

The Domain of Definition of the L\'evy White Noise

Abstract

It is possible to construct L\'evy white noises as generalized random processes in the sense of Gel'fand and Vilenkin, or as an independently scattered random measures introduced by Rajput and Rosinski. In this article, we unify those two approaches by extending the L\'evy white noise, defined as a generalized random process, to an independently scattered random measure. We are then able to give general integrability conditions for L\'evy white noises, thereby maximally enlarging their domain of definition. Based on this connection, we provide new criteria for the practical determination of the domain of definition, including specific results for the subfamilies of Gaussian, symmetric-{\alpha}-stable, generalized Laplace, and compound Poisson white noises. We also apply our results to formulate a general criterion for the existence of generalized solutions of linear stochastic partial differential equations driven by a L\'evy white noise.

Explore related subjects

Keep this discovery

BibTeXRIS

Julien Fageot, Thomas Humeau. 2017-08-08. The Domain of Definition of the L\'evy White Noise. https://arxiv.org/abs/1708.02500

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