SearcharxivSearch

arXiv · 1810.12011

Long-memory Gaussian processes governed by generalized Fokker-Planck equations

Abstract

It is well-known that the transition function of the Ornstein-Uhlenbeck process solves the Fokker-Planck equation. This standard setting has been recently generalized in different directions, for example, by considering the so-called $\alpha $-stable driven Ornstein-Uhlenbeck, or by time-changing the original process with an inverse stable subordinator. In both cases, the corresponding partial differential equations involve fractional derivatives (of Riesz and Riemann-Liouville types, respectively) and the solution is not Gaussian. We consider here a new model, which cannot be expressed by a random time-change of the original process: we start by a Fokker-Planck equation (in Fourier space) with the time-derivative replaced by a new fractional differential operator. The resulting process is Gaussian and, in the stationary case, exhibits a long-range dependence. Moreover, we consider further extensions, by means of the so-called convolution-type derivative.

Explore related subjects

Keep this discovery

BibTeXRIS

Luisa Beghin. 2018-10-29. Long-memory Gaussian processes governed by generalized Fokker-Planck equations. https://arxiv.org/abs/1810.12011

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