Explosive Percolation in Random Networks

Networks in which the formation of connections is governed by a random process often undergo a percolation transition, wherein around a critical point, the addition of a small number of connections causes a sizable fraction of the network to suddenly become linked together. Typically such transitions are continuous, so that the percentage of the network linked together tends to zero right above the transition point. Whether percolation transitions could be discontinuous has been an open question. Here, we show that incorporating a limited amount of choice in the classic Erdös-Rényi network formation model causes its percolation transition to become discontinuous.

[1]  Alan M. Frieze,et al.  Avoiding a giant component , 2001, Random Struct. Algorithms.

[2]  M. Newman,et al.  Fast Monte Carlo algorithm for site or bond percolation. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[4]  宁北芳,et al.  疟原虫var基因转换速率变化导致抗原变异[英]/Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A , 2005 .

[5]  Joel H. Spencer,et al.  Birth control for giants , 2007, Comb..

[6]  Andrew Beveridge,et al.  Product rule wins a competitive game , 2007 .

[7]  Benny Sudakov,et al.  Hamiltonicity thresholds in Achlioptas processes , 2008, Random Struct. Algorithms.