Infinitely Divisible Distributions in Integer‐Valued Garch Models

We propose an integer‐valued stochastic process with conditional marginal distribution belonging to the class of infinitely divisible discrete probability laws. With this proposal, we introduce a wide class of models for count time series that includes the Poisson integer‐valued generalized autoregressive conditional heteroscedastic (INGARCH) model (Ferland et al., 2006) and the negative binomial and generalized Poisson INGARCH models (Zhu, 2011, 2012a). The main probabilistic analysis of this process is developed stating, in particular, first‐order and second‐order stationarity conditions. The existence of a strictly stationary and ergodic solution is established in a subclass including the Poisson and generalized Poisson INGARCH models.     

On composite likelihood estimation of a multivariate INAR(1) model

In several circumstances the collected data are counts observed in different time points, while the counts at each time point are correlated. Current models are able to account for serial correlation but usually fail to account for cross‐correlation. Motivated by the lack of appropriate tools for handling such type of data, we define a multivariate integer‐valued autoregressive process of order 1 (MINAR(1)) and examine its basic statistical properties. Apart from the general specification of the MINAR(1) process, we also study two specific parametric cases that arise under the assumptions of a multivariate Poisson and a multivariate negative binomial distribution for the innovations of the process. To overcome the computational difficulties of the maximum likelihood approach we suggest the method of composite likelihood. The performance of the two methods of estimation, that is, maximum likelihood and composite likelihood, is compared through a small simulation experiment. Extensions of the time‐invariant model to a regression model are also discussed. The proposed model is applied to a trivariate data series related to daily traffic accidents in three areas in the Netherlands.     

Zero‐Modified Geometric INAR(1) Process for Modelling Count Time Series with Deflation or Inflation of Zeros

In this article, we propose a first‐order integer‐valued autoregressive [INAR(1)] process for dealing with count time series with deflation or inflation of zeros. The proposed process has zero‐modified geometric marginals and contains the geometric INAR(1) process as a particular case. The proposed model is also capable of capturing underdispersion and overdispersion, which sometimes are caused by deflation or inflation of zeros. We explore several statistical and mathematical properties of the process, discuss point estimation of the parameters and find the asymptotic distribution of the proposed estimators. We also propose a test based on our model for checking if the count time series considered is deflated or inflated of zeros. Two empirical illustrations are presented in order to show the potential for practice of our zero‐modified geometric INAR(1) process. This article contains a Supporting Information.     

A geometric time series model with dependent Bernoulli counting series

A new stationary first‐order integer‐valued autoregressive process with geometric marginal distribution based on the generalized binomial thinning is introduced. The model involves dependent count variables. Some properties of the process are determined. A set of estimators are obtained, and their asymptotic distributions are considered. Some numerical results of the estimates are presented. Possible application of the process is discussed through the real data example.     

MCMC for Integer‐Valued ARMA processes

Abstract. The classical statistical inference for integer‐valued time‐series has primarily been restricted to the integer‐valued autoregressive (INAR) process. Markov chain Monte Carlo (MCMC) methods have been shown to be a useful tool in many branches of statistics and is particularly well suited to integer‐valued time‐series where statistical inference is greatly assisted by data augmentation. Thus in this article, we outline an efficient MCMC algorithm for a wide class of integer‐valued autoregressive moving‐average (INARMA) processes. Furthermore, we consider noise corrupted integer‐valued processes and also models with change points. Finally, in order to assess the MCMC algorithms inferential and predictive capabilities we use a range of simulated and real data sets.     

Integer‐Valued GARCH Process

Abstract. An integer‐valued analogue of the classical generalized autoregressive conditional heteroskedastic (GARCH) (p,q) model with Poisson deviates is proposed and a condition for the existence of such a process is given. For the case p = 1, q = 1, it is explicitly shown that an integer‐valued GARCH process is a standard autoregressive moving average (1, 1) process. The problem of maximum likelihood estimation of parameters is treated. An application of the model to a real time series with a numerical example is given.     

Maximum likelihood estimation of higher‐order integer‐valued autoregressive processes

Abstract. In this article, we extend the earlier work of Freeland and McCabe [Journal of time Series Analysis (2004) Vol. 25, pp. 701–722] and develop a general framework for maximum likelihood (ML) analysis of higher‐order integer‐valued autoregressive processes. Our exposition includes the case where the innovation sequence has a Poisson distribution and the thinning is binomial. A recursive representation of the transition probability of the model is proposed. Based on this transition probability, we derive expressions for the score function and the Fisher information matrix, which form the basis for ML estimation and inference. Similar to the results in Freeland and McCabe (2004) , we show that the score function and the Fisher information matrix can be neatly represented as conditional expectations. Using the INAR(2) specification with binomial thinning and Poisson innovations, we examine both the asymptotic efficiency and finite sample properties of the ML estimator in relation to the widely used conditional least squares (CLS) and Yule–Walker (YW) estimators. We conclude that, if the Poisson assumption can be justified, there are substantial gains to be had from using ML especially when the thinning parameters are large.     

Poisson QMLE of Count Time Series Models

Regularity conditions are given for the consistency of the Poisson quasi‐maximum likelihood estimator of the conditional mean parameter of a count time series model. The asymptotic distribution of the estimator is studied when the parameter belongs to the interior of the parameter space and when it lies at the boundary. Tests for the significance of the parameters and for constant conditional mean are deduced. Applications to specific integer‐valued autoregressive (INAR) and integer‐valued generalized autoregressive conditional heteroscedasticity (INGARCH) models are considered. Numerical illustrations, Monte Carlo simulations and real data series are provided.     

Local asymptotic normality and efficient estimation for INAR(p) models

Abstract. Integer‐valued autoregressive (INAR) processes have been introduced to model non‐negative integer‐valued phenomena that evolve in time. The distribution of an INAR(p) process is determined by two parameters: a vector of survival probabilities and a probability distribution on the non‐negative integers, called an immigration distribution. This paper provides an efficient estimator of the parameters, and in particular, shows that the INAR(p) model has the Local Asymptotic Normality property.     

Empirical likelihood inference for random coefficient INAR(p) process

In this article, we study the empirical likelihood (EL) method for the pth‐order random coefficient integer‐valued autoregressive process. In particular, the limiting distribution of the log EL ratio statistic is established and the confidence regions for the parameter of interest are derived. Also a simulation study is conducted for the evaluation of the developed approach.     

A mixed INAR(p) model

A mixed integer‐valued autoregressive model of order p is proposed. The existence of this unique, stationary and ergodic process is proved and its autocorrelation structure and some conditional stochastic characteristics are derived. Model parameters are estimated via Yule‐Walker, conditional least squares and conditional maximum likelihood methods. Finally, possible application of the model to real data sets is considered.     

Score statistics for testing serial dependence in count data

In this study, we extend earlier work of Freeland (1998) and Jung and Tremayne (2003) , and develop a general formula for a score statistic to test for dependence in an integer autoregressive process with an arbitrary arrivals distribution. We give two statistics that cater for arrivals processes that may be under‐, equi‐ or overdispersed. The first is based on the Katz family which includes Poisson, binomial and negative binomial distributions as special cases. The second uses the generalized Poisson which includes the Poisson distribution as a special case and can also cater for under‐ and over‐ dispersion. The null distribution of the tests is provided and consistency is discussed. Size and power properties are investigated under different model assumptions by Monte Carlo simulations. The autocorrelation coefficient is also investigated as a benchmark for comparison.     

An Extended Portmanteau Test for VARMA Models With Mixing Nonlinear Constraints

Abstract. The portmanteau test is a widely used diagnostic tool for univariate and multivariate time‐series models. Its asymptotic distribution is known for the unconstrained vector autoregressive moving‐average (VARMA) case and for VAR models with constraints on the autoregressive coefficients. In this article, we give conditions under which the test can be applied to constrained VARMA models. Unfortunately, it cannot generally be applied to models with constraints that simultaneously affect the ARMA polynomial coefficients and the covariance matrix of the innovations (mixing constraints). This happens in latent‐variable models such as dynamic factor models (DFM). In addition, when there are constraints on the covariance matrix it seems convenient to check the goodness of fit using the zero‐lag residual covariances. We propose an extended portmanteau test that not only checks the autocorrelations of the residuals but also whether their covariance matrix is consistent with the constraints. We prove that the statistic is asymptotically distributed as a chi‐square for ARMA models under the assumption that the innovations have Gaussian‐like fourth‐order moments. We also show that the test is appropriate for the DFM, Peña–Box model and factor‐structural vector autoregression (FSVAR).     

Convolution‐closed models for count time series with applications

There has recently been an upsurge of interest in time series models for count data. Many papers focus on the model with first‐order (Markov) dependence and Poisson innovations. Our paper considers practical models that can capture higher‐order dependence based on the work of Joe (1996). In this framework we are able to model both equidispersed and overdispersed marginal distributions of data. The latter is approached using generalized Poisson innovations. Central to the models is the use of the property of closure under convolution of certain families of random variables. The models can be thought of as stationary Markov chains of finite order. Parameter estimation is undertaken by maximum likelihood, inference procedures are considered and means of assessing model adequacy employed. Applications to two new data sets are provided.     

Integer‐Valued Autoregressive Models With Survival Probability Driven By A Stochastic Recurrence Equation

This paper proposes a new class of integer‐valued autoregressive models with a dynamic survival probability. The peculiarity of this class of models lies in the specification of the survival probability through a stochastic recurrence equation. The proposed models can effectively capture changing dependence over time and enhance both the in‐sample and out‐of‐sample performance of integer‐valued autoregressive models. This point is illustrated through an empirical application to a real‐time series of crime reports. Additionally, this paper discusses the reliability of likelihood‐based inference for the class of models. In particular, this study proves the consistency of the maximum likelihood estimator and a plug‐in estimator for the conditional probability mass function in a misspecified model setting.     

A negative binomial integer‐valued GARCH model

This article discusses the modelling of integer‐valued time series with overdispersion and potential extreme observations. For the problem, a negative binomial INGARCH model, a generalization of the Poisson INGARCH model, is proposed and stationarity conditions are given as well as the autocorrelation function. For estimation, we present three approaches with the focus on the maximum likelihood approach. Some results from numerical studies are presented and indicate that the proposed methodology performs better than the Poisson and double Poisson model‐based methods.     

Random environment integer‐valued autoregressive process

An r states random environment integer‐valued autoregressive process of order 1, RrINAR(1), is introduced. Also, a random environment process is separately defined as a selection mechanism of differently parameterized geometric distributions, thus ensuring the non‐stationary nature of the RrNGINAR(1) model based on the negative binomial thinning. The distributional and correlation properties of this model are discussed, and the k‐step‐ahead conditional expectation and variance are derived. Yule–Walker estimators of model parameters are presented and their strong consistency is proved. The RrNGINAR(1) model motivation is justified on simulated samples and by its application to specific real‐life counting data.     

EFFICIENT METHOD OF MOMENTS ESTIMATORS FOR INTEGER TIME SERIES MODELS

The parameters of integer autoregressive models with Poisson, or negative binomial innovations can be estimated by maximum likelihood where the prediction error decomposition, together with convolution methods, is used to write down the likelihood function. When a moving average component is introduced this is not the case. To address this problem an efficient method of moment estimator is proposed where the estimated standard errors for the parameters are obtained using subsampling methods. The small sample properties of the estimator are investigated using Monte Carlo methods, while the approach is demonstrated using two well‐known examples from the time series literature.     

Conway–Maxwell–Poisson Autoregressive Moving Average Model for Equidispersed,Underdispersed, and Overdispersed Count Data

In this work, we propose a dynamic regression model based on the ConwayŮMaxwell–Poisson (CMP) distribution with time-varying conditional mean depending on covariates and lagged observations. This new class of ConwayŮMaxwell–Poisson autoregressive moving average (CMP-ARMA) models is suitable for the analysis of time series of counts. The CMP distribution is a two-parameter generalization of the Poisson distribution that allows the modeling of underdispersed, equidispersed, and overdispersed data. Our main contribution is to combine this dispersion flexibility with the inclusion of lagged terms to model the conditional mean response, inducing an autocorrelation structure, usually relevant in time series. We present the conditional maximum likelihood estimation, hypothesis testing inference, diagnostic analysis, and forecasting along with their asymptotic properties. In particular, we provide closed-form expressions for the conditional score vector and conditional Fisher information matrix. We conduct a Monte Carlo experiment to evaluate the performance of the estimators in finite sample sizes. Finally, we illustrate the usefulness of the proposed model by exploring two empirical applications.     

Negative Binomial Autoregressive Process with Stochastic Intensity

We introduce negative binomial‐60 autoregressive (NBAR) processes with stochastic intensity for (univariate and bivariate) count processes. The univariate NBAR process is defined jointly with an underlying intensity process, which is autoregressive gamma. The resulting count process is Markov, with negative binomial conditional and marginal distributions. The process is then extended to the bivariate case with a Wishart autoregressive matrix intensity process. The NBAR processes are compound autoregressive, which allows for simple stationarity condition and quasi‐closed form nonlinear forecasting formulae at any horizon, as well as a computationally tractable generalized method of moment estimator. The model is applied to a pairwise analysis of weekly occurrence counts of a contagious disease between the greater Paris region and other French regions.