CONTACT PROCESSES ON RANDOM GRAPHS WITH POWER LAW DEGREE DISTRIBUTIONS HAVE CRITICAL VALUE 0

被引:134
作者
Chatterjee, Shirshendu [1 ]
Durrett, Rick [1 ]
机构
[1] Cornell Univ, Ithaca, NY 14853 USA
关键词
Contact process; power-law random graph; epidemic threshold; DISTANCES;
D O I
10.1214/09-AOP471
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
If we consider the contact process with infection rate lambda on a random graph on n vertices with power law degree distributions, mean field calculations suggest that the critical value lambda(c) of the infection rate is positive if the power alpha > 3. Physicists seem to regard this as an established fact, since the result has recently been generalized to bipartite graphs by Gomez-Gardefies et al. [Proc. Nad. Acad. Sci. USA 105 (2008) 1399-1404]. Here, we show that the critical value lambda(c) is zero for any value of alpha > 3, and the contact process starting from all vertices infected, with a probability tending to 1 as n -> infinity, maintains a positive density of infected sites for time at least exp(n(1-delta)) for any delta > 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 rho(lambda). It is expected that p(lambda) similar to C lambda(beta) as lambda -> 0. Here we show that alpha - 1 <= beta <= 2 alpha - 3, and so beta > 2 for alpha > 3. Thus even though the graph is locally tree-like, beta does not take the mean field critical value beta = 1.
引用
收藏
页码:2332 / 2356
页数:25
相关论文
共 22 条
[1]  
BERGER N, 2009, WEAK LOCAL IN PRESS
[2]  
Berger N, 2005, PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P301
[3]  
Bollobas, 2001, RANDOM GRAPHS, DOI 10.1017/CBO9780511814068
[4]   The average distances in random graphs with given expected degrees [J].
Chung, F ;
Lu, LY .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2002, 99 (25) :15879-15882
[5]  
Chung F. R. K., 2003, Internet Mathematics, V1, P91, DOI 10.1080/15427951.2004.10129081
[6]   A general model of web graphs [J].
Cooper, C ;
Frieze, A .
RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (03) :311-335
[7]   THE CONTACT PROCESS ON A FINITE-SET .2. [J].
DURRETT, R ;
SCHONMANN, RH .
ANNALS OF PROBABILITY, 1988, 16 (04) :1570-1583
[8]   THE CONTACT PROCESS ON A FINITE-SET [J].
DURRETT, R ;
LIU, XF .
ANNALS OF PROBABILITY, 1988, 16 (03) :1158-1173
[9]  
Durrett Richard, 2007, Random Graph Dynamics
[10]   Two phase transitions for the contact process on small worlds [J].
Durrett, Rick ;
Jung, Paul .
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2007, 117 (12) :1910-1927