IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2025i2p457-475.html
   My bibliography  Save this article

A simple INAR(1) model for analyzing count time series with multiple features

Author

Listed:
  • Yao Kang
  • Danshu Sheng
  • Feilong Lu

Abstract

Count time series frequently exhibit multiple features such as zero inflation, zero deflation, overdispersion, and underdispersion. In practice, heavy-tailedness and zero truncation are also suffered but are less investigated. To better handle count time series with the above statistical characteristics, we introduce a simple INAR(1) process with zero-distorted generalized geometric innovations, which has the advantage of being capable of capturing all the above features. Probabilistic and statistical properties of the process are explored and estimators of the model parameters are derived by the Yule-Walker, conditional least squares, conditional maximum likelihood, and Bayesian methods. Finally, the new model is also employed to analyze the following three real data examples. Firstly, we consider the website traffic counts, which implies that the new model can take into account count time series with overdispersion, zero inflation, and heavy-tailedness. Secondly, we demonstrate the usefulness of the new model in describing underdispersed and zero-deflated count time series via an application to the number of examination room of the emergency department of a children’s hospital. Thirdly, we employ the new model to the monthly shifted counts of robbery, which indicates the new model can better handle zero-truncated count times series.

Suggested Citation

  • Yao Kang & Danshu Sheng & Feilong Lu, 2025. "A simple INAR(1) model for analyzing count time series with multiple features," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(2), pages 457-475, January.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:2:p:457-475
    DOI: 10.1080/03610926.2024.2314613
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2314613
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2024.2314613?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:54:y:2025:i:2:p:457-475. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.