Abstract

ABSTRACTWe consider a Markovian SIR-type (Susceptible → Infected → Recovered) stochastic epidemic process with multiple modes of transmission on a contact network. The network is given by a random graph following a multilayer configuration model where edges in different layers correspond to potentially infectious contacts of different types. We assume that the graph structure evolves in response to the epidemic via activation or deactivation of edges of infectious nodes. We derive a large graph limit theorem that gives a system of ordinary differential equations (ODEs) describing the evolution of quantities of interest, such as the proportions of infected and susceptible vertices, as the number of nodes tends to infinity. Analysis of the limiting system elucidates how the coupling of edge activation and deactivation to infection status affects disease dynamics, as illustrated by a two-layer network example with edge types corresponding to community and healthcare contacts. Our theorem extends some earlier results describing the deterministic limit of stochastic SIR processes on static, single-layer configuration model graphs. We also describe precisely the conditions for equivalence between our limiting ODEs and the systems obtained via pair approximation, which are widely used in the epidemiological and ecological literature to approximate disease dynamics on networks. The flexible modeling framework and asymptotic results have potential application to many disease settings including Ebola dynamics in West Africa, which was the original motivation for this study.

Highlights

  • A fundamental issue in disease dynamics is that contact patterns change in response to infection

  • We derive a large graph limit theorem that gives a system of ordinary differential equations (ODEs) describing the evolution of quantities of interest, such as the proportions of infected and susceptible vertices, as the number of nodes tends to infinity

  • We describe precisely the conditions for equivalence between our limiting ODEs and the systems obtained via pair approximation, which are widely used in the epidemiological and ecological literature to approximate disease dynamics on networks

Read more

Summary

Introduction

A fundamental issue in disease dynamics is that contact patterns change in response to infection. We obtain a relatively simple limiting model in the setting where network connectivity changes with the evolution of the disease process It follows that for a certain class of random graphs the large graph limit coincides with the model obtained using either the pairwise [45] or the edge-based [98] approximation approach. The proof of our main theorem is given in Appendix 2 which provides further mathematical details along with a summary of notation for the main body of the paper

Stochastic model
Layered configuration model
SIdaR process
Large graph limit theorems
General case
Edge-based limiting systems
Pairwise limiting systems
Pairwise model
Large-graph-consistent pair approximation
Community-healthcare network example
Discussion
Independent Poissons case
Model reduction
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call