TY - JOUR

T1 - Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably "Explosive"

AU - Veremyev, Alexander

AU - Boginski, Vladimir

AU - Krokhmal, Pavlo A.

AU - Jeffcoat, David E.

PY - 2012/12/18

Y1 - 2012/12/18

N2 - Recent reports suggest that evolving large-scale networks exhibit "explosive percolation": a large fraction of nodes suddenly becomes connected when sufficiently many links have formed in a network. This phase transition has been shown to be continuous (second-order) for most random network formation processes, including classical mean-field random networks and their modifications. We study a related yet different phenomenon referred to as dense percolation, which occurs when a network is already connected, but a large group of nodes must be dense enough, i.e., have at least a certain minimum required percentage of possible links, to form a "highly connected" cluster. Such clusters have been considered in various contexts, including the recently introduced network modularity principle in biological networks. We prove that, contrary to the traditionally defined percolation transition, dense percolation transition is discontinuous (first-order) under the classical mean-field network formation process (with no modifications); therefore, there is not only quantitative, but also qualitative difference between regular and dense percolation transitions. Moreover, the size of the largest dense (highly connected) cluster in a mean-field random network is explicitly characterized by rigorously proven tight asymptotic bounds, which turn out to naturally extend the previously derived formula for the size of the largest clique (a cluster with all possible links) in such a network. We also briefly discuss possible implications of the obtained mathematical results on studying first-order phase transitions in real-world linked systems.

AB - Recent reports suggest that evolving large-scale networks exhibit "explosive percolation": a large fraction of nodes suddenly becomes connected when sufficiently many links have formed in a network. This phase transition has been shown to be continuous (second-order) for most random network formation processes, including classical mean-field random networks and their modifications. We study a related yet different phenomenon referred to as dense percolation, which occurs when a network is already connected, but a large group of nodes must be dense enough, i.e., have at least a certain minimum required percentage of possible links, to form a "highly connected" cluster. Such clusters have been considered in various contexts, including the recently introduced network modularity principle in biological networks. We prove that, contrary to the traditionally defined percolation transition, dense percolation transition is discontinuous (first-order) under the classical mean-field network formation process (with no modifications); therefore, there is not only quantitative, but also qualitative difference between regular and dense percolation transitions. Moreover, the size of the largest dense (highly connected) cluster in a mean-field random network is explicitly characterized by rigorously proven tight asymptotic bounds, which turn out to naturally extend the previously derived formula for the size of the largest clique (a cluster with all possible links) in such a network. We also briefly discuss possible implications of the obtained mathematical results on studying first-order phase transitions in real-world linked systems.

UR - http://www.scopus.com/inward/record.url?scp=84871339060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871339060&partnerID=8YFLogxK

U2 - 10.1371/journal.pone.0051883

DO - 10.1371/journal.pone.0051883

M3 - Article

C2 - 23272185

AN - SCOPUS:84871339060

SN - 1932-6203

VL - 7

JO - PloS one

JF - PloS one

IS - 12

M1 - e51883

ER -