Exact epidemic models on graphs using graph-automorphism driven lumping.
The dynamics of disease transmission strongly depends on the properties of the population contact network. Pair-approximation models and individual-based network simulation have been used extensively to model contact networks with non-trivial properties. In this paper, using a continuous time Markov chain, we start from the exact formulation of a simple epidemic model on an arbitrary contact network and rigorously derive and prove some known results that were previously mainly justified based on some biological hypotheses. The main result of the paper is the illustration of the link between graph automorphisms and the process of lumping whereby the number of equations in a system of linear differential equations can be significantly reduced. The main advantage of lumping is that the simplified lumped system is not an approximation of the original system but rather an exact version of this. For a special class of graphs, we show how the lumped system can be obtained by using graph automorphisms. Finally, we discuss the advantages and possible applications of exact epidemic models and lumping.
Simon
Péter L
PL
Institute of Mathematics, Eötvös Loránd University Budapest, Budapest, Hungary.
Taylor
Michael
M
Kiss
Istvan Z
IZ
D058872:Epidemics; D004812:Epidemiologic Methods; D006801:Humans; D008390:Markov Chains; D008954:Models, Biological