Pith. sign in

REVIEW 1 cited by

Novel Discrete Composite Distributions with Applications to Infectious Disease Data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.16443 v1 pith:D33FKOOS submitted 2023-09-28 stat.ME math.STstat.APstat.TH

classification stat.MEmath.STstat.APstat.TH
keywords distributionsdatainfectiouscasesdiscreteparetocompositediseases
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It was observed that the number of cases and deaths for infectious diseases were associated with heavy-tailed power law distributions such as the Pareto distribution. While Pareto distribution was widely used to model the cases and deaths of infectious diseases, a major limitation of Pareto distribution is that it can only fit a given data set beyond a certain threshold. Thus, it can only model part of the data set. Thus, we proposed some novel discrete composite distributions with Pareto tails to fit the real infectious disease data. To provide necessary statistical inference for the tail behavior of the data, we developed a hypothesis testing procedure to test the tail index parameter. COVID-19 reported cases in Singapore and monkeypox reported cases in France were analyzed to evaluate the performance of the newly created distributions. The results from the analysis suggested that the discrete composite distributions could demonstrate competitive performance compared to the commonly used discrete distributions. Furthermore, the analysis of the tail index parameter can provide great insights into preventing and controlling infectious diseases.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Scaling Natural-Language Graph-Based Test Time Compute for Automated Theorem Proving

    cs.CL 2025-02 conditional novelty 4.0 of 10

    KG-Prover shows that traversing a ProofWiki-derived knowledge graph at inference time improves LLM theorem-proving accuracy on miniF2F, ProofNet, and MUSTARDSAUCE without extra fine-tuning.

Pith tools