Epidemic Spreading in Non-Markovian Time-Varying Networks

Most real networks are characterized by connectivity patterns that evolve in time following complex, non-Markovian, dynamics. Here we investigate the impact of this ubiquitous feature by studying the Susceptible-Infected-Recovered (SIR) and Susceptible-Infected-Susceptible (SIS) epidemic models on activity driven networks with and without memory (i.e., Markovian and non-Markovian). We show that while memory inhibits the spreading process in SIR models, where the epidemic threshold is moved to larger values, it plays the opposite effect in the case of the SIS, where the threshold is lowered. The heterogeneity in tie strengths, and the frequent repetition of connections that it entails, allows in fact less virulent SIS-like diseases to survive in tightly connected local clusters that serve as reservoir for the virus. We validate this picture by evaluating the threshold of both processes in a real temporal network. Our findings confirm the important role played by non-Markovian network dynamics on dynamical processes.

[1]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[2]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[3]  Christine Klein,et al.  BMC Medicine , 2006 .

[4]  R. Rosenfeld Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[5]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[6]  Margaret-Mary G. Wilson,et al.  Sexually transmitted diseases. , 2003, Clinics in geriatric medicine.

[7]  Michael Höhle,et al.  Modeling Infectious Diseases in Humans and Animals. M. J. Keeling and P. Rohani (2008). NJ, USA: Princeton University Press. ISBN: 978‐0‐691‐11617‐3 , 2009 .

[8]  J. Urry Complexity , 2006, Interpreting Art.

[9]  宁北芳,et al.  疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A , 2005 .

[10]  Albert-László Barabási,et al.  Scale-free networks , 2008, Scholarpedia.

[11]  October I Physical Review Letters , 2022 .

[12]  E. Todeva Networks , 2007 .

[13]  D. F. Marks,et al.  An introduction , 1988, Experientia.

[14]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[15]  Nello Cristianini,et al.  The 17th ACM SIGKDD conference on Knowledge Discovery and Data Mining (KDD) , 2011 .

[16]  Giorgio Parisi,et al.  Physica A: Statistical Mechanics and its Applications: Editorial note , 2005 .

[17]  Öznur Özkasap,et al.  Ad-Hoc Networks , 2008, Encyclopedia of Algorithms.