SearcharxivSearch

arXiv · 2503.15894

The Gaussian central limit theorem for a stationary time series with infinite variance

Abstract

We consider a borderline case: the central limit theorem for a strictly stationary time series with infinite variance but a Gaussian limit. In the iid case a well-known sufficient condition for this central limit theorem is regular variation of the marginal distribution with tail index $\alpha=2$. In the dependent case we assume the stronger condition of sequential regular variation of the time series with tail index $\alpha=2$. We assume that a sample of size $n$ from this time series can be split into $k_n$ blocks of size $r_n\to\infty$ such that $r_n/n\to 0$ as $n\to\infty$ and that the block sums are asymptotically independent. Then we apply classical central limit theory for row-wise iid triangular arrays. The necessary and sufficient conditions for such independent block sums will be verified by using large deviation results for the time series. We derive the central limit theorem for $m$-dependent sequences, linear processes, stochastic volatility processes and solutions to affine stochastic recurrence equations whose marginal distributions have infinite variance and are regularly varying with tail index $\alpha=2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muneya Matsui, Thomas Mikosch. 2025-03-20. The Gaussian central limit theorem for a stationary time series with infinite variance. https://arxiv.org/abs/2503.15894

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