Percolation phase transition of static and growing networks under a weighted function

Abstract

We investigate the percolation phase transitions in both the static and growing networks where the nodes are sampled according to a weighted function with a tunable parameter [Formula: see text]. For the static network, i.e. the number of nodes is constant during the percolation process, the percolation phase transition can evolve from continuous to discontinuous as the value of [Formula: see text] is tuned. Based on the properties of the weighted function, three typical values of [Formula: see text] are analyzed. The model becomes the classical Erdös–Rényi (ER) network model at [Formula: see text]. When [Formula: see text], it is shown that the percolation process generates a weakly discontinuous phase transition where the order parameter exhibits an extremely abrupt transition with a significant jump in large but finite system. For [Formula: see text], the cluster size distribution at the lower pseudo-transition point does not obey the power-law behavior, indicating a strongly discontinuous phase transition. In the case of growing network, in which the collection of nodes is increasing, a smoother continuous phase transition emerges at [Formula: see text], in contrast to the weakly discontinuous phase transition of the static network. At [Formula: see text], on the other hand, probability modulation effect shows that the nature of strongly discontinuous phase transition remains the same with the static network despite the node arrival even in the thermodynamic limit. These percolation properties of the growing networks could provide useful reference for network intervention and control in practical applications in consideration of the increasing size of most actual networks.