SearcharxivSearch

arXiv · 1902.02142

Cross-codifference for bidimensional VAR(1) models with infinite variance

Abstract

In this paper we consider the problem of a measure that allows us to describe the spatial and temporal dependence structure of multivariate time series with innovations having infinite variance. By using recent results obtained in the problem of temporal dependence structure of univariate stochastic processes, where the auto-codifference was used, we extend its idea and propose a cross-codifference measure for a general vector autoregressive model of order 1 (VAR(1)). Next, we derive an analytical results for VAR(1) model with Gaussian and sub-Gaussian innovations, that are characterized by finite and infinite variance, respectively. We emphasize that obtained expressions perfectly agree with the empirical counterparts. Moreover, we show that for the considered processes the cross-codifference simplifies to the well-established cross-covariance measure in case of Gaussian white noise. Last part of the work is devoted to the statistical estimation of VAR(1) parameters based on the empirical cross-codifference. Again, we demonstrate via Monte Carlo simulations that proposed methodology works correctly.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleksandra Grzesiek, Marek Teuerle, Agnieszka Wyłomańska. 2019-02-06. Cross-codifference for bidimensional VAR(1) models with infinite variance. https://arxiv.org/abs/1902.02142

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