Explosive Percolation with Multiple Giant Components
- 15 March 2011
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 106 (11) , 115701
Abstract
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N.\,C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are considered one at a time and either added to the graph or rejected provided that the fraction of accepted edges is never smaller than a decreasing function asymptotically approaching the value $\alpha${}=1/2. We show that multiple giant components appear simultaneously in a strongly discontinuous percolation transition and remain distinct. Furthermore, tuning the value of $\alpha${} determines the number of such components with smaller $\alpha${} leading to an increasingly delayed and more explosive transition. The location of the critical point and strongly discontinuous nature are not affected if only edges which span components are sampled.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Impact of single links in competitive percolationNature Physics, 2011
- Explosive percolation in the human protein homology networkThe European Physical Journal B, 2010
- Construction and Analysis of Random Networks with Explosive PercolationPhysical Review Letters, 2009
- Explosive Percolation in Scale-Free NetworksPhysical Review Letters, 2009
- Percolation Transitions in Scale-Free Networks under the Achlioptas ProcessPhysical Review Letters, 2009
- Explosive Growth in Biased Dynamic Percolation on Two-Dimensional Regular Lattice NetworksPhysical Review Letters, 2009
- Explosive Percolation in Random NetworksScience, 2009
- Percolation with multiple giant clustersJournal of Physics A: General Physics, 2005
- Avoidance of a giant component in half the edge set of a random graphRandom Structures & Algorithms, 2004
- Epidemic Spreading in Scale-Free NetworksPhysical Review Letters, 2001