Abstract
We propose the -selective percolation process as a model for the iterative removals of nodes with the specific intermediate degree in complex networks. In the model, a random node with degree is deactivated one by one until no more nodes with degree remain. The non-monotonic response of the giant component size on various synthetic and real-world networks implies a conclusion that a network can be more robust against such selective attack by removing further edges. In the theoretical perspective, the -selective percolation process exhibits a rich repertoire of phase transitions, including double transitions of hybrid and continuous, as well as reentrant transitions. Notably, we observe a tricritical-like point on Erdős-Rényi networks. We also examine a discontinuous transition with unusual order parameter fluctuation and distribution on simple cubic lattices, which does not appear in other percolation models with cascade processes. Finally, we perform finite-size scaling analysis to obtain critical exponents on various transition points, including those exotic ones.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.