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 rewire the networks such that their robustness to network fragmentation is improved but without changing neither the degree distribution nor the connectivity of single nodes. We show that simulated annealing improves on the results previously obtained with a simple hill-climbing procedure. We also introduce a local move operator in order to facilitate actual rewiring and show numerically that the results are almost equally good. © 2011 Springer-Verlag.
CITATION STYLE
Buesser, P., Daolio, F., & Tomassini, M. (2011). Optimizing the robustness of scale-free networks with simulated annealing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6594 LNCS, pp. 167–176). https://doi.org/10.1007/978-3-642-20267-4_18
Mendeley helps you to discover research relevant for your work.