Score-based bootstrap test for serial dependence in count time series

Testing for serial dependence in count time series is crucial in many applications, especially when adopting widely used Integer Autoregressive (INAR) models. Existing approaches rely on score-based test statistics, typically assuming Poisson innovations. Such tests cannot account for overdispersion, underdispersion, and zero inflation, which are common issues in real data. Existing bootstrap methods have not been thoroughly investigated for their effectiveness under varying dispersion conditions. We propose a novel restricted bootstrap algorithm to enhance the performance of score-based tests for serial dependence in INAR models. Negative Binomial and Generalized Poisson distributions are considered to address overdispersion, underdispersion, and zero inflation. Both parametric and semiparametric bootstraps are implemented, providing a more flexible framework for testing. We demonstrate the effectiveness of the proposed approach through a simulation study and an analysis of six real datasets with varying autocorrelation strengths, dispersion levels, and zero inflation. The bootstrapped Generalized Poisson score statistics provide preferable results, especially for underdispersed and heavily zero-inflated data. In the Poisson case, semiparametric and parametric bootstraps can be compared, providing a detection tool for equidispersion of the arrivals.

Authors

Institutions

Publication Details

Journal
Journal of Statistical Computation and Simulation
Published
2025-08-04
DOI
https://doi.org/10.1080/00949655.2025.2541913
Primary Topic
Financial Risk and Volatility Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Score-based bootstrap test for serial dependence in count time series

Riccardo Ievoli, Lucio Palazzo
Journal of Statistical Computation and Simulation
Financial Risk and Volatility Modeling
article

Score-based bootstrap test for serial dependence in count time series

Riccardo Ievoli, Lucio Palazzo
article en

Abstract

Testing for serial dependence in count time series is crucial in many applications, especially when adopting widely used Integer Autoregressive (INAR) models. Existing approaches rely on score-based test statistics, typically assuming Poisson innovations. Such tests cannot account for overdispersion, underdispersion, and zero inflation, which are common issues in real data. Existing bootstrap methods have not been thoroughly investigated for their effectiveness under varying dispersion conditions. We propose a novel restricted bootstrap algorithm to enhance the performance of score-based tests for serial dependence in INAR models. Negative Binomial and Generalized Poisson distributions are considered to address overdispersion, underdispersion, and zero inflation. Both parametric and semiparametric bootstraps are implemented, providing a more flexible framework for testing. We demonstrate the effectiveness of the proposed approach through a simulation study and an analysis of six real datasets with varying autocorrelation strengths, dispersion levels, and zero inflation. The bootstrapped Generalized Poisson score statistics provide preferable results, especially for underdispersed and heavily zero-inflated data. In the Poisson case, semiparametric and parametric bootstraps can be compared, providing a detection tool for equidispersion of the arrivals.

Journal of Statistical Computation and SimulationVol. 95(17)
University of Naples - L'Orientale (IT), University of Ferrara (IT)
Openalex Percentile: Top 75%
Financial Risk and Volatility Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.