Article

# Cluster aggregation model for discontinuous percolation transitions.

Department of Physics and Astronomy, Seoul National University, Seoul 151-747, Korea.

Physical Review E (Impact Factor: 2.31). 03/2010; 81(3 Pt 1):030103. DOI: 10.1103/PhysRevE.81.030103 Source: PubMed

- [Show abstract] [Hide abstract]

**ABSTRACT:**We propose a simple generalization of the explosive percolation process [Achlioptas et al., Science 323, 1453 (2009)], and investigate its structural and transport properties. In this model, at each step, a set of q unoccupied bonds is randomly chosen. Each of these bonds is then associated with a weight given by the product of the cluster sizes that they would potentially connect, and only that bond among the q set which has the smallest weight becomes occupied. Our results indicate that, at criticality, all finite-size scaling exponents for the spanning cluster, the conducting backbone, the cutting bonds, and the global conductance of the system, change continuously and significantly with q. Surprisingly, we also observe that systems with intermediate values of q display the worst conductive performance. This is explained by the strong inhibition of loops in the spanning cluster, resulting in a substantially smaller associated conducting backbone.Physical Review E 03/2011; 83(3 Pt 1):031133. · 2.31 Impact Factor - [Show abstract] [Hide abstract]

**ABSTRACT:**The study of the phase transition of random graph processes, and recently in particular Achlioptas processes, has attracted much attention. Achlioptas, D'Souza and Spencer (Science, 2009) gave strong numerical evidence that a variety of edge-selection rules in Achlioptas processes exhibit a discontinuous phase transition. However, Riordan and Warnke (Science, 2011) recently showed that all these processes have a continuous phase transition.In this work we prove discontinuous phase transitions for three random graph processes: all three start with the empty graph on n vertices and, depending on the process, we connect in every step (i) one vertex chosen randomly from all vertices and one chosen randomly from a restricted set of vertices, (ii) two components chosen randomly from the set of all components, or (iii) a randomly chosen vertex and a randomly chosen component.Combinatorics Probability and Computing 01/2011; abs/1104.1309. · 0.61 Impact Factor - [Show abstract] [Hide abstract]

**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 α=1/2. We show that multiple giant components appear simultaneously in a strongly discontinuous percolation transition and remain distinct. Furthermore, tuning the value of α determines the number of such components with smaller α 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.Physical Review Letters 03/2011; 106(11):115701. · 7.73 Impact Factor

Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.