SearcharxivSearch

arXiv · 1507.06093

The structure of entrance laws for time-inhomogeneous Ornstein-Uhlenbeck Processes with L\'evy Noise in Hilbert spaces

Abstract

This paper is about the structure of all entrance laws (in the sense of Dynkin) for time-inhomogeneous Ornstein-Uhlenbeck processes with L\'evy noise in Hilbert state spaces. We identify the extremal entrance laws with finite weak first moments through an explicit formula for their Fourier transforms, generalising corresponding results by Dynkin for Wiener noise and nuclear state spaces. We then prove that an arbitrary entrance law with finite weak first moments can be uniquely represented as an integral over extremals. It is proved that this can be derived from Dynkin's seminal work "Sufficient statistics and extreme points" in Ann. Probab. 1978, which contains a purely measure theoretic generalization of the classical analytic Krein-Milman and Choquet Theorems. As an application, we obtain an easy uniqueness proof for T - periodic entrance laws in the general periodic case. A number of further applications to concrete cases are presented.

Explore related subjects

Keep this discovery

BibTeXRIS

N. Rezvani Majid, M. Röckner. 2015-07-22. The structure of entrance laws for time-inhomogeneous Ornstein-Uhlenbeck Processes with L\'evy Noise in Hilbert spaces. https://arxiv.org/abs/1507.06093

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