Exact epidemic models on graphs using graph-automorphism driven lumping
- 385 Downloads
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.
KeywordsNetwork Epidemic Markov chain Lumping Graph automorphism
Mathematics Subject Classification (2000)92D25 92D30 92D40 00A71 00A72
Unable to display preview. Download preview PDF.
- Anderson RM, May RM (1991) Infectious diseases of humans: dynamics and control. Oxford University PressGoogle Scholar
- Andersson H, Djehich B (1997) A threshold limit theorem for the stochastic logistic epidemic. J Appl Prob 35: 662–670Google Scholar
- Brauer F, van den Driessche P, Wu J (2008) In: (eds) Mathematical epidemiology. In: Lecture notes in mathematics. Springer-Verlag, BerlinGoogle Scholar
- Daley DJ, Gani J (1999) Epidemic modelling: an intoduction. Cambridge University PressGoogle Scholar
- Diekmann O, Heesterbeek JAP (2000) Mathematical epidemiology of infectious diseases: model building, analysis and interpretation. Wiley, ChichesterGoogle Scholar
- Filliger L, Hongler M-O (2008) Lumping complex networks. Madeira Math Encounters XXXV. http://ccm.uma.pt/mme35/files/LumpingNetworks-Filliger.pdf
- Gross JL, Yellen J (2003) Handbook of graph theory. CRC Press, Boca RatonGoogle Scholar
- Hundsdorfer W, Verwer JG (2003) Numerical solution of time-dependent advection-diffusion-reactions equations. Springer, New YorkGoogle Scholar
- van Baalen M (2000) Pair approximations for different spatial geometries. In: Dieckmann U, Law R, Metz JAJ (eds) The geometry of ecological interactions: simplifying complexity. Cambridge University Press, pp 359–387Google Scholar
- Yap HP (1986) Some topics in graph theory. In: London Mathematical Society, Lecture notes series 108. Cambridge University Press, CambridgeGoogle Scholar