SearcharxivSearch

arXiv · 1403.7544

The impact of the diagonals of polynomial forms on limit theorems with long memory

Abstract

We start with an i.i.d. sequence and consider the product of two polynomial-forms moving averages based on that sequence. The coefficients of the polynomial forms are asymptotically slowly decaying homogeneous functions so that these processes have long memory. The product of these two polynomial forms is a stationary nonlinear process. Our goal is to obtain limit theorems for the normalized sums of this product process in three cases: exclusion of the diagonal terms of the polynomial form, inclusion, or the mixed case (one polynomial form excludes the diagonals while the other one includes them). In any one of these cases, if the product has long memory, then the limits are given by Wiener chaos. But the limits in each of the cases are quite different. If the diagonals are excluded, then the limit is expressed as in the product formula of two Wiener-Itô integrals. When the diagonals are included, the limit stochastic integrals are typically due to a single factor of the product, namely the one with the strongest memory. In the mixed case, the limit stochastic integral is due to the polynomial form without the diagonals irrespective of the strength of the memory.

Explore related subjects

Keep this discovery

BibTeXRIS

Shuyang Bai, Murad S. Taqqu. 2016-09-30. The impact of the diagonals of polynomial forms on limit theorems with long memory. https://doi.org/10.3150/15-bej697

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