Dismantling Efficiency and Network Fractality (1804.10267v1)

Abstract: Network dismantling is to identify a minimal set of nodes whose removal breaks the network into small components of subextensive size. Because finding the optimal set of nodes is an NP-hard problem, several heuristic algorithms have been developed as alternative methods, for instance, the so-called belief propagation-based decimation (BPD) algorithm and the collective influence (CI) algorithm. Here, we test the performance of each of these algorithms and analyze them in the perspective of the fractality of the network. Networks are classified into two types: fractal and non-fractal networks. Real-world examples include the World Wide Web and Internet at the autonomous system level, respectively. They have different ratios of long-range shortcuts to short-range ones. We find that the BPD algorithm works more efficiently for fractal networks than for non-fractal networks, whereas the opposite is true of the CI algorithm. Furthermore, we construct diverse fractal and non-fractal model networks by controlling parameters such as the degree exponent, shortcut number, and system size, and investigate how the performance of the two algorithms depends on structural features.