REVIEW 3 cited by
Generation interval contraction and epidemic data analysis
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
Signed reviews
read the original abstract
The generation interval is the time between the infection time of an infected person and the infection time of his or her infector. Probability density functions for generation intervals have been an important input for epidemic models and epidemic data analysis. In this paper, we specify a general stochastic SIR epidemic model and prove that the mean generation interval decreases when susceptible persons are at risk of infectious contact from multiple sources. The intuition behind this is that when a susceptible person has multiple potential infectors, there is a ``race'' to infect him or her in which only the first infectious contact leads to infection. In an epidemic, the mean generation interval contracts as the prevalence of infection increases. We call this global competition among potential infectors. When there is rapid transmission within clusters of contacts, generation interval contraction can be caused by a high local prevalence of infection even when the global prevalence is low. We call this local competition among potential infectors. Using simulations, we illustrate both types of competition. Finally, we show that hazards of infectious contact can be used instead of generation intervals to estimate the time course of the effective reproductive number in an epidemic. This approach leads naturally to partial likelihoods for epidemic data that are very similar to those that arise in survival analysis, opening a promising avenue of methodological research in infectious disease epidemiology.
Forward citations
Cited by 3 Pith papers
-
Architecture-aware Unitary Synthesis
A new method for unitary synthesis on quantum hardware cuts CNOT gates by up to 36% and compiles up to 553 times faster than standard tools on square and heavy-hex lattices.
-
Overcoming Quadratic Hardware Scaling for a Fully Connected Digital Oscillatory Neural Network
A hybrid serial-parallel FPGA architecture for fully connected oscillatory neural networks scales arithmetic logic near-linearly, enabling 506 oscillators on a Zynq-7020, but weight memory and latency still scale quad...
-
Enhancing Transportation Cyber-Physical Systems Security: A Shift to Post-Quantum Cryptography
A literature review plus an OMNeT++ simulation concluding that CRYSTALS-Kyber works over Ethernet but likely misses the 100 ms latency deadline for safety-critical wireless TCPS.
Discussion (0). Continue with ORCID to comment.