Contact processes on scale-free networks

Acta Mathematica Sinica, English Series

Volumn 26, Issue 7, 2010, Pages 1383-1392

  Chen, Dayue ^a   Liu, Qi ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Configuration model; Contact process; Epidemics; Random graph; Scale free

Indexed keywords

EID: 77953506793     PISSN: 14398516     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10114-010-7191-y     Document Type: Article

References (16)

1. Barabási, A. L., Albert, R.: Emergence of scaling in random networks. Sicence, 286, 509-512 (1999).
2. Pastor-Satorras, R., Vespigniani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Letters, 86, 3200-3203 (2001).
3. Pastor-Satorras, R., Vespigniani, A.: Epidemic dynamics in finite size scale-free networks. Phys. Rev. E, 65, 035108(R) (2002).
4. Zhou, T., Fu, Z., Niu, Y., et al.: Survey of spread dynamics on complex networks (in Chinese). Progress in Natrual Science, 15(5), 513-518 (2005).
5. Liggett, T. M.: Stochastic Interacting Systems: Contact, Voter and Exclusion Processes, Springer, New York, 1999.
6. Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Proc. Nat. Acad. Sci., 99, 15879-15882 (2002).
7. Bollobás, B.: Random Graphs, 2nd edition, Cambridge University Press, Cambridge, 2001.
8. Berger, N., Borgs, C., Chayes, J. T., et al.: On the spread of viruses on the Internet, Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithm (SODA), 2005, 301-310.
9. Ganesh, A., Massoulie, L., Towsley, D.: The effect of network topology on the spread of epidemics, Proc. IEEE Infocom, 2005.
10. Durrett, R.: Random Graph Dynamics, Cambridge University Press, Cambridge, 2007.
11. Chung, F., Lu, L.: Connected component in random graphs with given expected degree sequences. Annals of Combinatorics, 6, 125-145 (2002).
12. Bollobás, B., Riordan, O.: The diameter of a scale-free random graph. Combinatorica, 24, 5-34 (2004).
13. Cooper, C., Frieze, A.: A general model for web graphs. Random Structures and Algorithms, 22, 311-335 (2003).
14. Lu, L.: Probabilistic methods in massive graphs and internet computing. UCSD Ph. D dissertation, http://math. ucsd. edu/?llu/thesis. pdf, 2002.
15. Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Structues and Algorithms, 6, 161-179 (1995).
16. Molloy, M., Reed, B.: The size of the giant component of a random graph with a given degree sequence. Combinatorics, Probability, and Computing, 7, 295-305 (1998).