Optimizing the Robustness of Scale-Free Networks with Simulated Annealing
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.
Keywordsrobustness simulated annealing scale-free networks optimization
Unable to display preview. Download preview PDF.
- 6.Csardi, G., Nepusz, T.: The igraph software package for complex network research. Inter Journal Complex Systems, 1695 (2006)Google Scholar
- 11.R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2010)Google Scholar
- 12.Schneider, C.M., Andrade, J.S., Shinbrot, T., Herrmann, H.J.: Protein interaction networks are fragile against random attacks and robust against malicious attacks. Tech. rep. (2010)Google Scholar
- 13.Schneider, C.M., Moreira, A., Andrade, J.S., Havlin, S., Herrmann, H.J.: Onion-like network topology enhances robustness against malicious attacks. J. Stat. Mech. (2010) (to appear)Google Scholar
- 14.Schneider, J.J., Kirkpatrck, S.: Stochastic Optimization. Springer, Berlin (2006)Google Scholar