A memetic algorithm for enhancing the robustness of scale-free networks against malicious attacks

M Zhou, J Liu - Physica A: Statistical Mechanics and its Applications, 2014 - Elsevier
The robustness of the infrastructure of various real-life systems, which can be represented
by networks and manifests the scale-free property, is of great importance. Thus, in this …

A heuristic algorithm for enhancing the robustness of scale-free networks based on edge classification

L Rong, J Liu - Physica A: Statistical Mechanics and its Applications, 2018 - Elsevier
The essential of existing methods for promoting network robustness is randomly exchanging
the edges of networks. Without considering the network structure, the performance of these …

Enhancing network robustness against malicious attacks

A Zeng, W Liu - Physical Review E—Statistical, Nonlinear, and Soft …, 2012 - APS
In a recent work [Schneider, Proc. Natl. Acad. Sci. USA 108, 3838 (2011) PNASA6 0027-
8424 10.1073/pnas. 1009440108], the authors proposed a simple measure for network …

Designing comprehensively robust networks against intentional attacks and cascading failures

S Wang, J Liu - Information Sciences, 2019 - Elsevier
Networked systems exist broadly in daily life and have been greatly emphasized in recent
studies. Since these networks are always exposed in complicated environments and may …

Enhancing the robustness of scale-free networks

J Zhao, K Xu - Journal of Physics A: Mathematical and …, 2009 - iopscience.iop.org
Error tolerance and attack vulnerability are two common and important properties of complex
networks, which are usually used to evaluate the robustness of a network. Recently, much …

Maximizing network resilience against malicious attacks

W Li, Y Li, Y Tan, Y Cao, C Chen, Y Cai, KY Lee… - Scientific reports, 2019 - nature.com
The threat of a malicious attack is one of the major security problems in complex networks.
Resilience is the system-level self-adjusting ability of a complex network to retain its basic …

Optimizing the robustness of scale-free networks with simulated annealing

P Buesser, F Daolio, M Tomassini - … 2011, Ljubljana, Slovenia, April 14-16 …, 2011 - Springer
We study the robustness of Barabási-Albert scale-free networks with respect to intentional
attacks to highly connected nodes. Using the simulated annealing optimization heuristic, we …

New attack strategies for complex networks

T Nie, Z Guo, K Zhao, ZM Lu - Physica A: Statistical Mechanics and its …, 2015 - Elsevier
The invulnerability of complex networks is an important issue in that the behavior of scale-
free network differs from that of exponential network. According to the structural …

A comparative study of network robustness measures

J Liu, M Zhou, S Wang, P Liu - Frontiers of Computer Science, 2017 - Springer
The robustness is an important functionality of networks because it manifests the ability of
networks to resist failures or attacks. Many robustness measures have been proposed from …

Using mapping entropy to identify node centrality in complex networks

T Nie, Z Guo, K Zhao, ZM Lu - Physica A: Statistical Mechanics and its …, 2016 - Elsevier
The problem of finding the best strategy to attack a network or immunize a population with a
minimal number of nodes has attracted much current research interest. The assessment of …