SearcharxivSearch

arXiv · 0903.2421

Outliers in INAR(1) models

Abstract

In this paper the integer-valued autoregressive model of order one, contaminated with additive or innovational outliers is studied in some detail. Moreover, parameter estimation is also addressed. Supposing that the time points of the outliers are known but their sizes are unknown, we prove that the Conditional Least Squares (CLS) estimators of the offspring and innovation means are strongly consistent. In contrast, however, the CLS estimators of the outliers' sizes are not strongly consistent, although they converge to a random limit with probability 1. This random limit depends on the values of the process at the outliers' time points and on the values at the preceding time points and in case of additive outliers also on the values at the following time points. We also prove that the joint CLS estimator of the offspring and innovation means is asymptotically normal. Conditionally on the above described values of the process, the joint CLS estimator of the sizes of the outliers is also asymptotically normal.

Explore related subjects

Keep this discovery

BibTeXRIS

Matyas Barczy, Marton Ispany, Gyula Pap, Manuel Scotto, Maria Eduarda Silva. 2010-02-28. Outliers in INAR(1) models. https://arxiv.org/abs/0903.2421

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