The infection time of graphs

Discrete Applied Mathematics

Volumn 154, Issue 18, 2006, Pages 2577-2589

  Dimitriou, Tassos ^a   Nikoletseas, Sotiris ^b   Spirakis, Paul ^b  

^a ATHENS INFORMATION TECHNOLOGY   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Infection time; Markov chains; Random walk

Indexed keywords

COLOR; COMPUTATION THEORY; DATA PROCESSING; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING;

GRAPH INFECTION TIME; MOBILE HOSTS; PROBABILISTIC TOOLS; RANDOM WALK;

GRAPH THEORY;

EID: 33750471973     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.026     Document Type: Article

References (19)

1. D. Aldous, J. Fill, Reversible Markov chains and random walks on graphs, unpublished manuscript, 〈http://stat-www.berkeley.edu/users/aldous/book.html〉, 1999.
2. Alon N. Eigenvalues and expanders. Combinatorica 6 (1986) 83-96
3. J. Aspnes, W. Hurwood, Spreading rumors rapidly despite an adversary, in: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, PODC96, 1996.
4. Chatzigiannakis I., and Nikoletseas S. Design and analysis of an efficient communication strategy for hierarchical and highly changing ad-hoc mobile networks. ACM/Baltzer Mobile Networks J., Special Issue on Parallel Processing Issues in Mobile Computing, Guest Editors: A. Zomaya, M. Kumar, MONET 9 4 (2004) 319-332
5. I. Chatzigiannakis, S. Nikoletseas, P. Spirakis, An efficient communication strategy for ad-hoc mobile networks, in: Proceedings of the 15th International Symposium on Distributed Computing-DISC'01, Lecture Notes in Computer Science, vol. 2180, Springer, Berlin, 2001, pp. 285-299, Also Brief Announcement, in: Proceedings of the 20th Annual Symposium on Principles of Distributed Computing-PODC'01, ACM Press, New York, 2001, pp. 320-322.
6. Chatzigiannakis I., Nikoletseas S., and Spirakis P. Distributed communication and control algorithms for ad-hoc mobile networks. J. Parallel and Distributed Comput., Special Issue on Mobile Ad-hoc Networking and Computing 63 (2003) 58-74
7. Coppersmith D., Tetali P., and Winkler P. Collisions among random walks on a graph. SIAM J. Discrete Math. 6 3 (1993) 363-374
8. T. Dimitriou, S. Nikoletseas, P. Spirakis, Analysis of the information propagation time among mobile hosts, in: Proceedings of the Third International Conference on Ad Hoc Networks and Wireless Networks (ADHOC-NOW), Lecture Notes in Computer Science, Springer, Berlin, 2004, pp. 122-134.
9. S. Even, B. Monien, On the number of rounds needed to disseminate information, in: Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures, SPAA89, 1989.
10. Feller W. An Introduction to Probability Theory and its Applications (1957), Wiley, New York
11. M.R. Jerrum, A. Sinclair, Conductance and the rapid mixing property of Markov chains: the approximation of the permanent resolved, in: Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), 1988, pp. 235-244.
12. J. Kephard, S. White, Directed-graph epidemiological models of computer viruses, in: Proceedings of the IEEE Symposium on Security and Privacy, 1991, Also IBM Technical Report.
13. Liggett T. Stochastic Interacting Systems: Contact, Voter and Exclusion Processes (1999), Springer, Berlin
14. Mehlhorn K., and Naher S. LEDA: A Platform for Combinatorial and Geometric Computing (1999), Cambridge University Press, Cambridge
15. S. Nikoletseas, G. Prasinos, P. Spirakis, C. Zaroliagis, Attack propagation in networks, in: Theory Comput. Systems J., Special Issue on the Thirteenth (13th) Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), 36, 2003, pp. 553-574.
16. Norris J.R. Markov Chains (1997), Cambridge University Press, Cambridge
17. R. Ostrofsky, M. Yung, How to withstand mobile virus attacks, in: Proceedings of the 10th ACM Symposium on Principles of Distributed Computing-PODC91, 1991, p. 51-59.
18. Sunderam V.S., and Winkler P. Disc. Appl. Math. 42 (1993) 75-86
19. Tetali P., and Winkler P. Simultaneous reversible Markov chains. In: Miklos D., Sos V.T., and Szonyi T. (Eds). Combinatorics, Paul Erd os is Eighty vol. 1 (1993), Janos Bolyai Mathematics Institute, Budapest 433-452