Abstract
We present qualitative arguments concerning the probable infection pattern in a directed graph under the (weak or strong) influence of the outside world. This question is relevant for real computer viruses, which spread by following the (logical) directed links formed by address lists. Our arguments build on previous work in two (seemingly unrelated) areas: epidemic spreading on undirected graphs, and eigenvectors of directed graphs as applied to Web page ranking. More specifically, we borrow a recently proven result (used to design a ’sink remedy’ for Web link analysis) and use it to argue for a threshold effect: that the effects of the outside world will not appear in the pattern of infection until the strength of the influence of the outside world exceeds a finite threshold value. We briefly discuss possible tests of this prediction, and its implications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200–3203 (2001)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM ’99. Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 251–262. ACM Press, New York (1999)
Canright, G., Engø-Monsen, K.: Roles in networks. Science of Computer Programming, 195–214 (2004)
Canright, G., Engø-Monsen, K.: Spreading on networks: a topographic view. In: Proceedings, European Conference on Complex Systems (2005)
Canright, G., Engø-Monsen, K.: Epidemic spreading over networks: a view from neighbourhoods. Telektronikk 101, 65–85 (2005)
Kephart, J.O., White, S.R.: Directed-graph epidemiological models of computer viruses. In: Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy, pp. 343–359 (1991)
Newman, M.E.J., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Physical Review E 66, 35–101 (2002)
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: Proceedings of the 9th international World Wide Web conference on Computer networks: the international journal of computer and telecommunications networking, pp. 309–320. North-Holland Publishing Co, The Netherlands, Amsterdam (2000)
Burgess, M., Canright, G., Engø-Monsen, K.: Mining location importance from the eigenvectors of directed graphs (2006), http://research.iu.hio.no/papers/directed.pdf
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46(5), 604–632 (1999)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)
Minc, H.: Non-negative Matrices. Wiley Interscience, New York (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Canright, G., Engø-Monsen, K. (2007). A ‘Pumping’ Model for the Spreading of Computer Viruses. In: Bandara, A.K., Burgess, M. (eds) Inter-Domain Management. AIMS 2007. Lecture Notes in Computer Science, vol 4543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72986-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-72986-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72985-3
Online ISBN: 978-3-540-72986-0
eBook Packages: Computer ScienceComputer Science (R0)