SearcharxivSearch

arXiv · 1304.5209

Multivariate limits of multilinear polynomial-form processes with long memory

Abstract

We consider the multilinear polynomial-form process \[X(n)=\sum_{1\le i_1<\ldots<i_k<\infty}a_{i_1}\ldots a_{i_k}ε_{n-i_1}\ldotsε_{n-i_k},\] obtained by applying a multilinear polynomial-form filter to i.i.d.\ sequence $\{ε_i\}$ where $\{a_i\}$ is regularly varying. The resulting sequence $\{X(n)\}$ will then display either short or long memory. Now consider a vector of such X(n), whose components are defined through different $\{a_i\}$'s, that is, through different multilinear polynomial-form filters, but using the same $\{ε_i\}$. What is the limit of the normalized partial sums of the vector? We show that the resulting limit is either a) a multivariate Gaussian process with Brownian motion as marginals, or b) a multivariate Hermite process, or c) a mixture of the two. We also identify the independent components of the limit vectors.

Explore related subjects

Keep this discovery

BibTeXRIS

Murad S. Taqqu, Shuyang Bai. 2013-04-18. Multivariate limits of multilinear polynomial-form processes with long memory. https://arxiv.org/abs/1304.5209

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