Search arXivSearch

arXiv · 2005.06552

Regional analysis of COVID-19 in France from fit of hospital data with different evolutionary models

Abstract

The SIR evolutionary model predicts too sharp a decrease of the fractions of people infected with COVID-19 in France after the start of the national lockdown, compared to what is observed. I fit the daily hospital data: arrivals in regular and critical care units, releases and deaths, using extended SEIR models. These involve ratios of evolutionary timescales to branching fractions, assumed uniform throughout a country, and the basic reproduction number, $R_0$, before and during the national lockdown, for each region of France. The joint-region Bayesian analysis allows precise evaluations of the time/fraction ratios and pre-hospitalized fractions. The hospital data are well fit by the models, except the arrivals in critical care, which decrease faster than predicted, indicating better treatment over time. Averaged over France, the analysis yields $R_0$= 3.4$\pm$0.1 before the lockdown and 0.65$\pm$0.04 (90% c.l.) during the lockdown, with small regional variations. On 11 May 2020, the Infection Fatality Rate in France was 4 $\pm$1% (90% c.l.), while the Feverish vastly outnumber the Asymptomatic, contrary to the early phases. Without the lockdown nor social distancing, over 2 million deaths from COVID-19 would have occurred throughout France, while a lockdown that would have been enforced 10 days earlier would have led to less than 1000 deaths. The fraction of immunized people reached a plateau below 1% throughout France (3% in Paris) by late April 2020 (95% c.l.), suggesting a lack of herd immunity. The widespread availability of face masks on 11 May, when the lockdown was partially lifted, should keep $R_0$ below unity if at least 46% of the population wear them outside their home. Otherwise, without enhanced other social distancing, a second wave is inevitable and cause the number of deaths to triple between early May and October (if $R_0$=1.2) or even late June (if $R_0$=2).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gary A. Mamon. 2020-06-16. Regional analysis of COVID-19 in France from fit of hospital data with different evolutionary models. https://arxiv.org/abs/2005.06552

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