Abstract
A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight according to a distribution that is allowed to depend on the degree of its vertex. Half-edges with the same weight are then paired randomly to create edges. An expression for the threshold for the appearance of a giant component in the resulting graph is derived using results on multi-type branching processes. The same technique also gives an expression for the basic reproduction number for an epidemic on the graph where the probability that a certain edge is used for transmission is a function of the edge weight (reflecting how closely ‘connected’ the corresponding vertices are). It is demonstrated that, if vertices with large degree tend to have large (small) weights on their edges and if the transmission probability increases with the edge weight, then it is easier (harder) for the epidemic to take off compared to a randomized epidemic with the same degree and weight distribution. A recipe for calculating the probability of a large outbreak in the epidemic and the size of such an outbreak is also given. Finally, the model is fitted to three empirical weighted networks of importance for the spread of contagious diseases and it is shown that R 0 can be substantially over- or underestimated if the correlation between degree and weight is not taken into account.
Similar content being viewed by others
References
Andersson, H.: Limit theorems for a random graph epidemic model. Ann. Appl. Probab. 8, 1331–1349 (1998)
Andersson, H.: Epidemic models and social networks. Math. Scientist 24, 128–147 (1999)
Britton, T.: Stochastic epidemic models: a survey. Math. Biosci. 225, 24–35 (2010)
Britton, T., Janson, S., Martin-Löf, A.: Graphs with specified degree distributions, simple epidemics and local vaccination strategies. Adv. Appl. Probab. 39, 922–948 (2007)
Britton, T., Nordvik, M., Liljeros, F.: Modeling sexually transmitted infections: the effect of partnership activity and number of partners on R 0. Theor. Popul. Biol. 72, 389–399 (2007)
Chen, Y., Paul, G., Cohen, R., Havlin, S., Borgatti, S.P., Liljeros, F., Stanley, E.: Percolation theory applied to measures of fragmentation in networks. Phys. Rev. E 75, 046107 (2007)
Chen, Y., Paul, G., Havlin, S., Liljeros, F., Stanley, E.: Finding a better immunization strategy. Phys. Rev. Lett. 101, 058701 (2008)
Deijfen, M.: Epidemics and vaccination on weighted graphs, Math. Biosci. 232(1), 57–65 (2010)
Durrett, R.: Random Graph Dynamics. Cambridge University Press, Cambridge (2007)
van der Hofstad, R.: Random Graphs and Complex Networks. Available at www.win.tue.nl/~rhofstad (2010)
Jagers, P.: Branching Processes and Biological Applications. Wiley, New York (1975)
Janson, S., Luczak, M.: A new approach to the giant component problem. Random Struct. Algorithms 34, 197–216 (2008)
Liljeros, F., Giesecke, J., Holme, P.: The contact network of inpatients in a regional healthcare system: a longitudinal case study. Math. Popul. Stud. 14, 269–284 (2007)
Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Struct. Algorithms 6, 161–179 (1995)
Molloy, M., Reed, B.: The size of the giant component of a random graphs with a given degree sequence. Comb. Probab. Comput. 7, 295–305 (1998)
Neal, P.: Multitype randomised Reed-Frost epidemics and epidemics upon random graphs. Ann. Appl. Probab. 16, 1166–1189 (2006)
Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89, 1–4 (2002)
Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67, 1–13 (2003)
Nordvik, M., Liljeros, F.: Transmission of sexually transmitted infections. Sex. Transm. Dis. 33, 342–349 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Britton, T., Deijfen, M. & Liljeros, F. A Weighted Configuration Model and Inhomogeneous Epidemics. J Stat Phys 145, 1368–1384 (2011). https://doi.org/10.1007/s10955-011-0343-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-011-0343-3