Affiliation:
1. Department of Mathematics, School of Mathematical and Physical Sciences, University of Sussex, Falmer, Brighton BN1 9QH, UK
2. Department of Informatics, University of Sussex, Falmer BN1 9QH, UK
Abstract
Abstract
Stochastic epidemic models on networks are inherently high-dimensional and the resulting exact models are intractable numerically even for modest network sizes. Mean-field models provide an alternative but can only capture average quantities, thus offering little or no information about variability in the outcome of the exact process. In this article, we conjecture and numerically demonstrate that it is possible to construct partial differential equation (PDE)-limits of the exact stochastic susceptible-infected-susceptible epidemics on Regular, Erdős–Rényi, Barabási–Albert networks and lattices. To do this, we first approximate the exact stochastic process at population level by a Birth-and-Death process (BD) (with a state space of $O(N)$ rather than $O(2^N)$) whose coefficients are determined numerically from Gillespie simulations of the exact epidemic on explicit networks. We numerically demonstrate that the coefficients of the resulting BD process are density-dependent, a crucial condition for the existence of a PDE limit. Extensive numerical tests for Regular, Erdős–Rényi, Barabási–Albert networks and lattices show excellent agreement between the outcome of simulations and the numerical solution of the Fokker–Planck equations. Apart from a significant reduction in dimensionality, the PDE also provides the means to derive the epidemic outbreak threshold linking network and disease dynamics parameters, albeit in an implicit way. Perhaps more importantly, it enables the formulation and numerical evaluation of likelihoods for epidemic and network inference as illustrated in a fully worked out example.
Funder
Leverhulme Trust for the Research
Publisher
Oxford University Press (OUP)
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization,Management Science and Operations Research,Computer Networks and Communications
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献