Papers › Statistical Inference for Cumulative INAR(∞) Processes via Least-Squares

Statistical Inference for Cumulative INAR(∞) Processes via Least-Squares

2 Dec 2024arXiv:2412.01569links table onlyarchive 2025-07-28

Yingli Wang, Xiaohong Duan, Ping He

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

This paper investigates the cumulative Integer-Valued Autoregressive model of infinite order, denoted as INAR(∞), a class of processes crucial for modeling count time series and equivalent to discrete-time Hawkes processes. We propose a computationally efficient conditional least-squares (CLS) estimator to address the challenge of parameter inference in this infinite-dimensional setting. We establish the key theoretical properties of the estimator, including its consistency and asymptotic normality. A central contribution is the rigorous treatment of its large-sample distribution in a framework where the parameter dimension grows with the sample size, for which we derive the corresponding sandwich-form covariance matrix. The theoretical results are substantiated through comprehensive Monte Carlo simulations. These experiments demonstrate that the estimator's accuracy and stability systematically improve as the sample size increases, confirming its consistency. Furthermore, we show that the estimator's finite-sample distribution is well-approximated by a normal distribution, and this approximation becomes more robust with larger samples. Our work provides a complete and practical framework for statistical inference in cumulative INAR(∞) models. The code to reproduce the numerical experiments is publicly available at https://github.com/gagawjbytw/INAR_estimation.

PaperPDFCode

Code

gagawjbytw/inar_estimation officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections