Abstract

From social networks to complex infrastructures, many systems could be described by multiplex networks formed by a set of nodes connected via more than one type of links. Network disintegration, which is the problem of identifying a set of nodes or edges whose removal would maximize the network collapse, is significant for dismantling harmful networks. In this article, we consider the optimal disintegration strategy problem in multiplex networks and extend the attack mode to the layer node-based attack. An optimization model is proposed to search the optimal strategy of a multiplex network under layer node-based attack with fix attack length. Two types of strategies based on the information of multiplex nodes and layer nodes, respectively, are also given for comparison. Through experiments in both model networks and real networks, we found that the approximate optimal strategies could be identified by solving the model. The properties of the optimal strategies are also summarized.

Highlights

  • Recent decades have witnessed a dramatic advance in network sciences [1]

  • We extend the optimization model of the disintegration strategy in the multiplex network to layer node-based attack mode

  • Experiments in the model and real multiplex networks prove that the approximate optimal disintegration strategies obtained from the tabu search (TS) algorithm are superior to other strategies in different attack length

Read more

Summary

Introduction

Recent decades have witnessed a dramatic advance in network sciences [1]. Network robustness, as an important field of complex networks, aims to improve the resilience of systems and to construct more efficient architecture [2,3,4]. The optimization model of disintegration strategy in multiplex networks is improved to adapt the layer node-based attack. The optimization model for the disintegration strategy in a multiplex network under layer node-based attack can be described as follows: b) max Φ( X s.t. Considering the complementary relationship of different layers in the multiplex network, we use the size of the giant component C in the aggregated network as the measure function of the network b) is used to measure the disintegration effect of strategy X. We could obtain the approximate optimal disintegration strategy by solving the optimization model in Formula (6) through the TS algorithm

The Existing Disintegration Strategies
Multiplex Node-Based Strategies
Layer Node-Based Strategies
Experiments in Synthetic Networks with Different Degree Correlation
Experiments in Real Networks
Conclusions and Discussion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call