SearcharxivSearch

arXiv · 2106.01851

Berry-Esseen bounds and almost sure CLT for the quadratic variation of a general Gaussian process

Abstract

In this paper, we consider the explicit bound for the second-order approximation of the quadratic variation of a general fractional Gaussian process $(G_t)_{t\ge 0}$. The second order mixed partial derivative of the covariance function $ R(t,\, s)=\mathbb{E}[G_t G_s]$ can be decomposed into two parts, one of which coincides with that of fractional Brownian motion and the other of which is bounded by $(ts)^{H-1}$ up to a constant factor. This condition is valid for a class of continuous Gaussian processes that fails to be self-similar or have stationary increments. %Some examples include the subfractional Brownian motion and the bi-fractional Brownian motion. Under this assumption, we obtain the optimal Berry-Ess\'{e}en bounds when $H\in (0,\,\frac23]$ and the upper Berry-Ess\'{e}en bounds when $H\in (\frac23,\,\frac34]$. As a by-product, we also show the almost sure central limit theorem (ASCLT) for the quadratic variation when $H\in (0,\,\frac34]$. The results extend that of \cite{NP 09} to the case of general Gaussian processes, unify and improve the Berry-Ess\'{e}en bounds in \cite{Tu 11}, \cite{AE 12} and \cite{KL 21} for respectively the sub-fractional Brownian motion, the bi-fractional Brownian motion and the sub-bifractional Brownian motion.

Explore related subjects

Keep this discovery

BibTeXRIS

Yong Chen, Zhen Ding, Ying Li. 2021-06-03. Berry-Esseen bounds and almost sure CLT for the quadratic variation of a general Gaussian process. https://arxiv.org/abs/2106.01851

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