Inverting the Achlioptas rule for explosive percolation

Abstract

In the usual Achlioptas processes the smallest clusters of a few randomly chosen ones are selected to merge together at each step. The resulting aggregation process leads to the delayed birth of a giant cluster and the so-called explosive percolation transition showing a set of anomalous features. We explore a process with the opposite selection rule, in which the biggest clusters of the randomly chosen ones merge together. We develop a theory of this kind of percolation based on the Smoluchowski equation, find the percolation threshold, and describe the scaling properties of this continuous transition, namely, the critical exponents and amplitudes, and scaling functions. We show that, qualitatively, this transition is similar to the ordinary percolation one, though occurring in less connected systems.

6 pages, 2 figures

References in corpus (12)

• Critical phenomena in complex networks
• Self-organized adaptation of a simple neural circuit enables complex robot behaviour
• Impact of Single Links in Competitive Percolation -- How complex networks grow under competition
• Recent advances and open challenges in percolation
• Tricritical point in explosive percolation
• The power of choice in network growth
• Solution of the explosive percolation quest: Scaling functions and critical exponents
• Using explosive percolation in analysis of real-world networks
• Solution of the explosive percolation quest. II. Infinite-order transition produced by the initial distributions of clusters
• Explosive Percolation: Unusual Transitions of a Simple Model
• Continuous Percolation Phase Transitions of Two-dimensional Lattice Networks under a Generalized Achlioptas Process
• Method for estimating critical exponents in percolation processes with low sampling