Two-Peak and Three-Peak Optimal Complex Networks
arXiv:cond-mat/0403679 · doi:10.1103/PhysRevLett.92.118702
Abstract
A central issue in complex networks is tolerance to random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures but fragile to targeted attacks, versus networks with an exponentially decaying connectivity distribution, which are less tolerant to failures but more resilient to attacks. We prove analytically that the optimal network configuration under a classic measure of robustness is altogether different from both of the above: in all cases, failure and/or attack, there are no more than three distinct node connectivities in the optimal network.
References in corpus (13)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Error and attack tolerance of complex networks
- The large-scale organization of metabolic networks
- Random graphs with arbitrary degree distributions and their applications
- The spread of epidemic disease on networks
- Classes of behavior of small-world networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Cascade-based attacks on complex networks
- Breakdown of the Internet under intentional attack
- Organization of Growing Random Networks
- Critical load and congestion instabilities in scale-free networks
Cited by in corpus (35)
- Mitigation of Malicious Attacks on Networks
- Percolation on complex networks: Theory and application
- Entangled networks, synchronization, and optimal network topology
- Network robustness of multiplex networks with interlayer degree correlations
- Entropy Optimization of Scale-Free Networks Robustness to Random Failures
- Optimization of Robustness of Complex Networks
- Optimization of Network Robustness to Waves of Targeted and Random Attack
- Multiple, weak hits confuse complex systems: A transcriptional regulatory network as an example
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Evolution of robust network topologies: Emergence of central backbones
- The influence of the broadness of the degree distribution on network's robustness: comparing localized attack and random attack
- Optimization of robustness of scale-free network to random and targeted attacks
- Cavity-based robustness analysis of interdependent networks: Influences of intranetwork and internetwork degree-degree correlations
- Using graph concepts to understand the organization of complex systems
- Optimization of Network Robustness to Random Breakdowns
- A statistical mechanics approach for scale-free networks and finite-scale networks
- Optimization of network structure to random failures
- Percolation theory applied to measures of fragmentation in social networks
- Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
- Enhancing the robustness of scale-free networks
- Complex Network Properties of Chinese Natural Science Basic Research
- Multistage Random Growing Small-World Networks with Power-law degree Distribution
- Neighborhood Information-based Probabilistic Algorithm for Network Disintegration
- Goal-directed graph construction using reinforcement learning
- Generalized theory for node disruption in finite size complex networks
- Resilience of networks to environmental stress: From regular to random networks
- Topological changes at the jamming and gel transition of a reversible polymeric network
- Revealing directed effective connectivity of cortical neuronal networks from measurements
- Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
- Robustness analysis of bimodal networks in the whole range of degree correlation
- Limits and trade-offs of topological network robustness
- Dependence of the average to-node distance on the node degree for random graphs and growing networks
- Pseudo-Darwinian evolution of physical flows in complex networks
- Network Extreme Eigenvalue - from Multimodal to Scale-free Network
- Structure Entropy and Resistor Graphs