Search arXivSearch

arXiv · 2008.04989

A Monte Carlo approach to model COVID-19 deaths and infections using Gompertz functions

Abstract

This study describes the dynamics of COVID-19 deaths and infections via a Monte Carlo approach. The analyses include death's data from USA, Brazil, Mexico, UK, India and Russia, which comprise the four countries with the highest number of deaths/confirmed cases, as of Aug 07, 2020, according to the WHO. The Gompertz functions were fitted to the data of weekly averaged confirmed deaths per day by mapping the $χ^2$ values. The uncertainties, variances and covariances of the model parameters were calculated by propagation. The fitted functions for the average deaths per day for USA and India have an upward trend, with the former having a higher growth rate and quite huge uncertainties. For Mexico, UK and Russia, the fits are consistent with a slope down pattern. For Brazil we found a subtle trend down, but with significant uncertainties. The USA, UK and India data shown a first peak with a higher growth rate when compared to the second one, demonstrating the benefits of non-pharmaceutical interventions of sanitary measures and social distance flattening the curve. For USA, a third peak seems quite plausible, most likely related with the recent relaxation policies. Brazil's data are satisfactorily described by two highly overlapped Gompertz functions with similar growth rates, suggesting a two-steps process for the pandemic spreading. The 95% CI for the total number of deaths ($\times 10^3$) predicted by the model for Aug 31, 2020 are 160 to 220, 110 to 130, 59 to 62, 46.6 to 47.3, 54 to 63 and 16.0 to 16.7 for USA, Brazil, Mexico, UK, India and Russia, respectively. Our estimates for the prevalences of infections are in reasonable agreement with some preliminary reports from serological studies carried out in USA and Brazil. The method represents an effective framework to estimate the line-shape of the infection curves and the uncertainties of the relevant parameters based on the actual data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tulio Rodrigues, Otaviano Helene. 2020-08-11. A Monte Carlo approach to model COVID-19 deaths and infections using Gompertz functions. https://doi.org/10.1103/physrevresearch.2.043381

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE