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

A flexible count data model based on Bernoulli-Poisson-geometric convolution

Author

Listed:
  • Anupama Nandi
  • Aniket Biswas
  • Partha Jyoti Hazarika
  • G. G. Hamedani

Abstract

The current work introduces a new three-parameter discrete distribution for modeling over-dispersed as well as under-dispersed count data. The proposed distribution is derived as the convolution of the geometric distribution and the recently introduced BerPoi distribution. Here the proposed model is identified as the BPG model due to its genesis. We explore important statistical properties of the BPG distribution, including moments, survival and hazard rate functions, recurrence relations, generating functions, and dispersion behavior. We also establish attractive characterizations of this distribution in terms of conditional expectation and the reversed hazard rate function. The maximum likelihood estimation method is employed to estimate the unknown parameters of the distribution, and extensive simulation experiments are performed to assess its performance. A flexible count data regression model based on the proposed distribution is also developed. Different real-world applications in modeling over- and under-dispersed count data with and without covariates are considered to establish the relevance of the proposed model. The BPG model has convenient statistical properties and is shown to be better than its closest competitors in modeling applications.

Suggested Citation

  • Anupama Nandi & Aniket Biswas & Partha Jyoti Hazarika & G. G. Hamedani, 2025. "A flexible count data model based on Bernoulli-Poisson-geometric convolution," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(21), pages 6890-6915, November.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:21:p:6890-6915
    DOI: 10.1080/03610926.2025.2464081
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2025.2464081?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

    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:21:p:6890-6915. 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.