SearcharxivSearch

arXiv · 0912.3091

Quasi Ornstein-Uhlenbeck processes

Abstract

The question of existence and properties of stationary solutions to Langevin equations driven by noise processes with stationary increments is discussed, with particular focus on noise processes of pseudo-moving-average type. On account of the Wold-Karhunen decomposition theorem, such solutions are, in principle, representable as a moving average (plus a drift-like term) but the kernel in the moving average is generally not available in explicit form. A class of cases is determined where an explicit expression of the kernel can be given, and this is used to obtain information on the asymptotic behavior of the associated autocorrelation functions, both for small and large lags. Applications to Gaussian- and Lévy-driven fractional Ornstein-Uhlenbeck processes are presented. A Fubini theorem for Lévy bases is established as an element in the derivations.

Explore related subjects

Keep this discovery

BibTeXRIS

Ole E. Barndorff-Nielsen, Andreas Basse-O'Connor. 2011-07-14. Quasi Ornstein-Uhlenbeck processes. https://doi.org/10.3150/10-bej311

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