Optimization of the robustness of multimodal networks
- 31 July 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 74 (1) , 016125
Abstract
We investigate the robustness against both random and targeted node removal of networks in which , the distribution of nodes with degree , is a multimodal distribution, with and Dirac’s delta function . We refer to this type of network as a scale-free multimodal network. For , the network is a bimodal network; in the limit approaches infinity, the network models a scale-free network. We calculate and optimize the robustness for given values of the number of modes , the total number of nodes , and the average degree , using analytical formulas for the random and targeted node removal thresholds for network collapse. We find, when , that (i) the robustness against random and targeted node removal for this multimodal network is controlled by a single combination of variables, , (ii) the robustness of the multimodal network against targeted node removal decreases rapidly when the number of modes becomes larger than a critical value that is of the order of , and (iii) the values of exponent that characterizes the scale-free degree distribution of the multimodal network that maximize the robustness against both random and targeted node removal fall between 2.5 and 3.
Keywords
This publication has 24 references indexed in Scilit:
- Evolution and Structure of the Internet2004
- Evolution of Networks2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Scale-free topology of e-mail networksPhysical Review E, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- The large-scale organization of metabolic networksNature, 2000
- Graph structure in the WebComputer Networks, 2000
- Scale-free characteristics of random networks: the topology of the world-wide webPhysica A: Statistical Mechanics and its Applications, 2000
- Emergence of Scaling in Random NetworksScience, 1999
- On power-law relationships of the Internet topologyACM SIGCOMM Computer Communication Review, 1999