Vertex overload breakdown in evolving networks
arXiv:cond-mat/0204120 · doi:10.1103/PhysRevE.65.066109
Abstract
We study evolving networks based on the Barabasi-Albert scale-free network model with vertices sensitive to overload breakdown. The load of a vertex is defined as the betweenness centrality of the vertex. Two cases of load limitation are considered, corresponding to that the average number of connections per vertex is increasing with the network's size ("extrinsic communication activity"), or that it is constant ("intrinsic communication activity"). Avalanche-like breakdowns for both load limitations are observed. In order to avoid such avalanches we argue that the capacity of the vertices has to grow with the size of the system. An interesting irregular dynamics of the formation of the giant component (for the intrinsic communication activity case is also studied). Implications on the growth of the Internet is discussed.
To appear in Phys. Rev. E
References in corpus (4)
Cited by in corpus (47)
- The structure and function of complex networks
- Cascade-based attacks on complex networks
- Cascade control and defense in complex networks
- Modeling Cascading Failures in the North American Power Grid
- Efficient routing on complex networks
- Layered Complex Networks
- Analysis of a large-scale weighted network of one-to-one human communication
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Factors that predict better synchronizability on complex networks
- Generalized Network Dismantling
- Accurately modeling the Internet topology
- Edge overload breakdown in evolving networks
- Integrating static and dynamic information for routing traffic
- Congestion and centrality in traffic flow on complex networks
- Critical load and congestion instabilities in scale-free networks
- Trainspotting: Extraction and Analysis of Traffic and Topologies of Transportation Networks
- Efficient local strategies for vaccination and network attack
- Multiple routes transmitted epidemics on multiplex networks
- Performance of networks of artificial neurons: The role of clustering
- Extreme events in dynamical systems and random walkers: A review
- Cascades on a class of clustered random networks
- Efficient routing on scale-free networks based on local information
- A High Robustness and Low Cost Model for Cascading Failures
- Error and Attack Tolerance of Layered Complex Networks
- Resource allocation pattern in infrastructure networks
- A limited resource model of fault-tolerant capability against cascading failure of complex network
- Robustness of the avalanche dynamics in data packet transport on scale-free networks
- Universality Class of Fiber Bundle Model on Complex Networks
- A Mutual Selection Model for Weighted Networks
- The resilience of interdependent transportation networks under targeted attack
- Nonlocal effects and counter measures in cascading failures
- Geographical effects on cascading breakdowns of scale-free networks
- Network synchronizability analysis: the theory of subgraphs and complementary graphs
- Asymmetry in interdependence makes a multilayer system more robust against cascading failures
- Fluctuation-driven capacity distribution in complex networks
- Effect of shortest path multiplicity on congestion of multiplex networks
- Protecting infrastructure networks from cost-based attacks
- Prediction and mitigation of nonlocal cascading failures using graph neural networks
- Phase transition in the modified fiber bundle model
- Manipulation of extreme events on scale-free networks
- Oscillations of complex networks
- Enhancing Transport Efficiency by Hybrid Routing Strategy
- The Graph Structure of the Internet at the Autonomous Systems Level during Ten Years
- Inhomogeneous percolation models for spreading phenomena in random graphs
- Rank-based model for weighted network with hierarchical organization and disassortative mixing
- Theoretical approach and impact of correlations on the critical packet generation rate in traffic dynamics on complex networks
- Enhancement of Network Synchronizability via Two Oscillatory System