SIR epidemics on random graphs with a fixed degree sequence

  • Authors:

  • Tom Bohman;Michael Picollelli

  • Affiliations:

  • Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania;Department of Electrical and Computer Engineering, University of Delaware, Newark, Delaware

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let Δ 1 be a fixed positive integer. For \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath, amssymb}\pagestyle{empty}\begin{document}\begin{align*}{\textbf{ {z}}} \in \mathbb{R}_+^\Delta\end{align*} \end{document} **image** let Gz be chosen uniformly at random from the collection of graphs on ∥z∥1n vertices that have zin vertices of degree i for i = 1,…,Δ. We determine the likely evolution in continuous time of the SIR model for the spread of an infectious disease on Gz, starting from a single infected node. Either the disease halts after infecting only a small number of nodes, or an epidemic spreads to infect a linear number of nodes. Conditioning on the event that more than a small number of nodes are infected, the epidemic is likely to follow a trajectory given by the solution of an associated system of ordinary differential equations. These results also give the likely number of nodes infected during the course of the epidemic and the likely length in time of the epidemic. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.