Characterizing the Initial Phase of Epidemic Growth on some Empirical Networks

A key parameter in models for the spread of infectious diseases is the basic reproduction number $R_0$, which is the expected number of secondary cases a typical infected primary case infects during its infectious period in a large mostly susceptible population. In order for this quantity to be meaningful, the initial expected growth of the number of infectious individuals in the large-population limit should be exponential. We investigate to what extent this assumption is valid by performing repeated simulations of epidemics on selected empirical networks, viewing each epidemic as a random process in discrete time. The initial phase of each epidemic is analyzed by fitting the number of infected people at each time step to a generalised growth model, allowing for estimating the shape of the growth. For reference, similar investigations are done on some elementary graphs such as integer lattices in different dimensions and configuration model graphs, for which the early epidemic behaviour is known. We find that for the empirical networks tested in this paper, exponential growth characterizes the early stages of the epidemic, except when the network is restricted by a strong low-dimensional spacial constraint, such as is the case for the two-dimensional square lattice. However, on finite integer lattices of sufficiently high dimension, the early development of epidemics shows exponential growth.

[1]  Peter Grassberger,et al.  Two-Dimensional SIR Epidemics with Long Range Infection , 2013, 1305.5940.

[2]  A. Martin-Löf,et al.  Generating Simple Random Graphs with Prescribed Degree Distribution , 2006, 1509.06985.

[3]  J. Tolle 87.65 Can growth be faster than exponential, and just how slow is the logarithm? , 2003, The Mathematical Gazette.

[4]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[5]  Peter Guttorp,et al.  Statistical inference for branching processes , 1991 .

[6]  R. Wallace Traveling waves of HIV infection on a low dimensional 'socio-geographic' network. , 1991, Social science & medicine.

[7]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[8]  Doreen Pfeifer,et al.  Statistics and Data Analysis , 1997 .

[9]  Pieter Trapman,et al.  The growth of the infinite long-range percolation cluster , 2009, 0901.0661.

[10]  J. Wallinga,et al.  Inferring R0 in emerging epidemics—the effect of common population structure is small , 2016, Journal of The Royal Society Interface.

[11]  C. Viboud,et al.  A generalized-growth model to characterize the early ascending phase of infectious disease outbreaks , 2015, Epidemics.

[12]  R. Durrett Random Graph Dynamics: References , 2006 .

[13]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[14]  M. Newman Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[16]  Odo Diekmann,et al.  Mathematical Tools for Understanding Infectious Disease Dynamics , 2012 .

[17]  Denis Mollison,et al.  Spatial Contact Models for Ecological and Epidemic Spread , 1977 .

[18]  M. Boehnke,et al.  The Impact of Accelerating Faster than Exponential Population Growth on Genetic Variation , 2013, Genetics.

[19]  Tom Britton,et al.  Respondent-driven sampling and an unusual epidemic , 2016, J. Appl. Probab..

[20]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[21]  Peter Donnelly,et al.  Strong approximations for epidemic models , 1995 .

[22]  H. Poincaré,et al.  Percolation ? , 1982 .

[23]  Xiaowei Wu,et al.  Branching Processes with Biological Applications , 2010 .

[24]  Frank Ball,et al.  Threshold behaviour and final outcome of an epidemic on a random network with household structure , 2008, Advances in Applied Probability.

[25]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.