SearcharxivSearch

arXiv · 2007.06083

On almost sure limit theorems for heavy-tailed products of long-range dependent linear processes

Abstract

Marcinkiewicz strong law of large numbers, ${n^{-\frac1p}}\sum_{k=1}^{n} (d_{k}- d)\rightarrow 0\ $ almost surely with $p\in(1,2)$, are developed for products $d_k=\prod_{r=1}^s x_k^{(r)}$, where the $x_k^{(r)} = \sum_{l=-\infty}^{\infty}c_{k-l}^{(r)}\xi_l^{(r)}$ are two-sided linear processes with coefficients $\{c_l^{(r)}\}_{l\in \mathbb{Z}}$ and i.i.d. zero-mean innovations $\{\xi_l^{(r)}\}_{l\in \mathbb{Z}}$. The decay of the coefficients $c_l^{(r)}$ as $|l|\to\infty$, can be slow enough for $\{x_k^{(r)}\}$ to have long memory while $\{d_k\}$ can have heavy tails. The long-range dependence and heavy tails for $\{d_k\}$ are handled simultaneously and a decoupling property shows the convergence rate is dictated by the worst of long-range dependence and heavy tails, but not their combination. The Marcinkiewicz strong law of large numbers is also extended to the multivariate linear process case.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael A. Kouritzin, Sounak Paul. 2020-07-12. On almost sure limit theorems for heavy-tailed products of long-range dependent linear processes. https://doi.org/10.1016/j.spa.2022.06.021

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