On analytical approaches to epidemics on networks.
One way to describe the spread of an infection on a network is by approximating the network by a random graph. However, the usual way of constructing a random graph does not give any control over the number of triangles in the graph, while these triangles will naturally arise in many networks (e.g. in social networks). In this paper, random graphs with a given degree distribution and a given expected number of triangles are constructed. By using these random graphs we analyze the spread of two types of infection on a network: infections with a fixed infectious period and infections for which an infective individual will infect all of its susceptible neighbors or none. These two types of infection can be used to give upper and lower bounds for R(0), the probability of extinction and other measures of dynamics of infections with more general infectious periods.
Trapman
Pieter
P
Faculty of Veterinary Medicine, Utrecht University, The Netherlands. trapman@math.uu.nl
D003141:Communicable Diseases / Q000453:epidemiology* / Q000635:transmission*; D004196:Disease Outbreaks; D006801:Humans; D008433:Mathematics; D015233:Models, Statistical; D016571:Neural Networks, Computer; D011336:Probability; D012944:Social Support