We provide a rigorous axiomatic framework to study epidemiology on complex networks. Our axioms apply to the epidemic spreading on complex networks in which there are explicit correlations among the degrees of connected vertices as described in [1]. We prove a necessary and sufficient condition for our epidemic model to have a nonzero stationary solution. We believe this is the first proof of such a general result. Moreover, under appropriate conditions we show that the time independent solution is the limit of a unique time dependent solution. We also provide a rigorous definition of the epidemic threshold, λc : = 1/ λ1 with λ1 denoting the largest positive eigenvalue of an operator T given in the axioms of our model. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Loya, P., & Lucas, A. R. (2009). An axiomatic foundation for epidemics on complex networks. In Studies in Computational Intelligence (Vol. 207, pp. 135–146). Springer Verlag. https://doi.org/10.1007/978-3-642-01206-8_12
Mendeley helps you to discover research relevant for your work.