Epidemics on random intersection graphsTools Ball, Frank G., Sirl, David J. and Trapman, Pieter (2014) Epidemics on random intersection graphs. Annals of Applied Probability, 24 (3). pp. 10811128. ISSN 10505164 Full text not available from this repository.
Official URL: http://projecteuclid.org/euclid.aoap/1398258096
AbstractIn this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of cliques, each of random size, and infection can be transmitted between two individuals if and only if there is a clique they both belong to. Both the clique sizes and the number of cliques an individual belongs to follow mixed Poisson distributions. An infinitetype branching process approximation (with type being given by the length of an individual’s infectious period) for the early stages of an epidemic is developed and made fully rigorous by proving an associated limit theorem as the population size tends to infinity. This leads to a threshold parameter R∗, so that in a large population an epidemic with few initial infectives can give rise to a large outbreak if and only if R∗>1. A functional equation for the survival probability of the approximating infinitetype branching process is determined; if R∗≤1, this equation has no nonzero solution, while if R∗>1, it is shown to have precisely one nonzero solution. A law of large numbers for the size of such a large outbreak is proved by exploiting a singletype branching process that approximates the size of the susceptibility set of a typical individual.
Actions (Archive Staff Only)
