Source: Ann. Probab. Volume 37, Number 6
(2009), 2332-2356.
If we consider the contact process with infection rate λ on a random graph on n vertices with power law degree distributions, mean field calculations suggest that the critical value λc of the infection rate is positive if the power α>3. Physicists seem to regard this as an established fact, since the result has recently been generalized to bipartite graphs by Gómez-Gardeñes et al. [Proc. Natl. Acad. Sci. USA 105 (2008) 1399–1404]. Here, we show that the critical value λc is zero for any value of α>3, and the contact process starting from all vertices infected, with a probability tending to 1 as n→∞, maintains a positive density of infected sites for time at least exp(n1−δ) for any δ>0. Using the last result, together with the contact process duality, we can establish the existence of a quasi-stationary distribution in which a randomly chosen vertex is occupied with probability ρ(λ). It is expected that ρ(λ)∼Cλβ as λ→0. Here we show that α−1≤β≤2α−3, and so β>2 for α>3. Thus even though the graph is locally tree-like, β does not take the mean field critical value β=1.
References
Berger, N., Borgs, C., Chayes, J. T. and Saberi, A. (2005). On the spread of viruses on the internet. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms 301–310 (electronic). ACM, New York.
Berger, N., Borgs, C., Chayes, J. T. and Saberi, A. (2009). Weak local limits for preferential attachment graphs. To appear.
Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge Univ. Press, Cambridge.
Chung, F. and Lu, L. (2002). The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. USA 99 15879–15882 (electronic).
Chung, F. and Lu, L. (2003). The average distance in a random graph with given expected degrees. Internet Math. 1 91–113.
Cooper, C. and Frieze, A. (2003). A general model of web graphs. Random Structures Algorithms 22 311–335.
Durrett, R. (2007). Random Graph Dynamics. Cambridge Univ. Press, Cambridge.
Durrett, R. and Jung, P. (2007). Two phase transitions for the contact process on small worlds. Stochastic Process. Appl. 117 1910–1927.
Durrett, R. and Liu, X. F. (1988). The contact process on a finite set. Ann. Probab. 16 1158–1173.
Mathematical Reviews (MathSciNet):
MR942760
Durrett, R. and Schonmann, R. H. (1988). The contact process on a finite set. II. Ann. Probab. 16 1570–1583.
Mathematical Reviews (MathSciNet):
MR958203
Gómez-Gardeñes, J., Latora, V., Moreno, Y. and Profumo, E. (2008). Spreading of sexually transmitted diseases in heterosexual populations. Proc. Natl. Acad. Sci. 105 1399–1404.
Harris, T. E. (1974). Contact interactions on a lattice. Ann. Probab. 2 969–988.
Mathematical Reviews (MathSciNet):
MR356292
Janson, S., Łuczak, T. and Rucinski, A. (2000). Random Graphs. Wiley, New York.
Liggett, T. M. (1999). Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] 324. Springer, Berlin.
Mountford, T. S. (1993). A metastable result for the finite multidimensional contact process. Canad. Math. Bull. 36 216–226.
Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E. 64 026118.
Newman, M. E. J., Strogatz, S. H. and Watts, D. J. (2002). Random graph models of social networks. Proc. Nat. Acad. Sci. 99 2566–2572.
Pastor-Satorras, R. and Vespignani, A. (2001a). Epidemic spreading in scale-free networks. Phys. Rev. Letters 86 3200–3203.
Pastor-Satorras, R. and Vespignani, A. (2001b). Epidemic dynamics and endemic states in complex networks. Phys. Rev. E. 63 066117.
Pastor-Satorras, R. and Vespignani, A. (2002). Epidemic dynamics in finite size scale-free networks. Phys. Rev. E. 65 035108(R).
van den Esker, H., van der Hofstad, R., Hooghiemstra, G. and Znamenski, D. (2005). Distances in random graphs with infinite mean degrees. Extremes 8 111–141 (2006).
van der Hofstad, R., Hooghiemstra, G. and Znamenski, D. (2007). Distances in random graphs with finite mean and infinite variance degrees. Electron. J. Probab. 12 703–766 (electronic).