Bootstrap percolation on complex networks

被引:124
作者
Baxter, G. J. [1 ]
Dorogovtsev, S. N. [1 ,2 ]
Goltsev, A. V. [1 ,2 ]
Mendes, J. F. F. [1 ]
机构
[1] Univ Aveiro, Dept Fis, I3N, P-3810193 Aveiro, Portugal
[2] AF Ioffe Phys Tech Inst, St Petersburg 194021, Russia
关键词
K-CORE; METASTABILITY THRESHOLD; SUDDEN EMERGENCE; TREES;
D O I
10.1103/PhysRevE.82.011103
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
We consider bootstrap percolation on uncorrelated complex networks. We obtain the phase diagram for this process with respect to two parameters: f, the fraction of vertices initially activated, and p, the fraction of undamaged vertices in the graph. We observe two transitions: the giant active component appears continuously at a first threshold. There may also be a second, discontinuous, hybrid transition at a higher threshold. Avalanches of activations increase in size as this second critical point is approached, finally diverging at this threshold. We describe the existence of a special critical point at which this second transition first appears. In networks with degree distributions whose second moment diverges (but whose first moment does not), we find a qualitatively different behavior. In this case the giant active component appears for any f>0 and p>0, and the discontinuous transition is absent. This means that the giant active component is robust to damage, and also is very easily activated. We also formulate a generalized bootstrap process in which each vertex can have an arbitrary threshold.
引用
收藏
页数:8
相关论文
共 35 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[3]   Bootstrap percolation on the hypercube [J].
Balogh, J ;
Bollobás, B .
PROBABILITY THEORY AND RELATED FIELDS, 2006, 134 (04) :624-648
[4]   Bootstrap percolation on the random regular graph [J].
Balogh, Jozsef ;
Pittel, Boris G. .
RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) :257-286
[5]   Bootstrap percolation on infinite trees and non-amenable groups [J].
Balogh, Jozsef ;
Peres, Yuval ;
Pete, Gabor .
COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (05) :715-730
[6]  
Bollobas B., 1984, GRAPH THEORY COMBINA, P35
[7]   GABAergic Hub Neurons Orchestrate Synchrony in Developing Hippocampal Networks [J].
Bonifazi, P. ;
Goldin, M. ;
Picardo, M. A. ;
Jorquera, I. ;
Cattani, A. ;
Bianconi, G. ;
Represa, A. ;
Ben-Ari, Y. ;
Cossart, R. .
SCIENCE, 2009, 326 (5958) :1419-1424
[8]   Network robustness and fragility: Percolation on random graphs [J].
Callaway, DS ;
Newman, MEJ ;
Strogatz, SH ;
Watts, DJ .
PHYSICAL REVIEW LETTERS, 2000, 85 (25) :5468-5471
[9]   Finite size scaling in three-dimensional bootstrap percolation [J].
Cerf, R ;
Cirillo, ENM .
ANNALS OF PROBABILITY, 1999, 27 (04) :1837-1850
[10]  
CHALUPA J, 1979, J PHYS C SOLID STATE, V12, pL31, DOI 10.1088/0022-3719/12/1/008