Search arXivSearch

arXiv · 2010.02368

Complex network model for COVID-19: human behavior, pseudo-periodic solutions and multiple epidemic waves

Abstract

We propose a mathematical model for the transmission dynamics of SARS-CoV-2 in a homogeneously mixing non constant population, and generalize it to a model where the parameters are given by piecewise constant functions. This allows us to model the human behavior and the impact of public health policies on the dynamics of the curve of active infected individuals during a COVID-19 epidemic outbreak. After proving the existence and global asymptotic stability of the disease-free and endemic equilibrium points of the model with constant parameters, we consider a family of Cauchy problems, with piecewise constant parameters, and prove the existence of pseudo-oscillations between a neighborhood of the disease-free equilibrium and a neighborhood of the endemic equilibrium, in a biologically feasible region. In the context of the COVID-19 pandemic, this pseudo-periodic solutions are related to the emergence of epidemic waves. Then, to capture the impact of mobility in the dynamics of COVID-19 epidemics, we propose a complex network with six distinct regions based on COVID-19 real data from Portugal. We perform numerical simulations for the complex network model, where the objective is to determine a topology that minimizes the level of active infected individuals and the existence of topologies that are likely to worsen the level of infection. We claim that this methodology is a tool with enormous potential in the current pandemic context, and can be applied in the management of outbreaks (in regional terms) but also to manage the opening/closing of borders.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristiana J. Silva, Guillaume Cantin, Carla Cruz, Rui Fonseca-Pinto, Rui Passadouro da Fonseca, Estevao Soares dos Santos, Delfim F. M. Torres. 2020-10-05. Complex network model for COVID-19: human behavior, pseudo-periodic solutions and multiple epidemic waves. https://doi.org/10.1016/j.jmaa.2021.125171

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