Edge overload breakdown in evolving networks

Abstract

We investigate growing networks based on Barabasi and Albert's algorithm for generating scale-free networks, but with edges sensitive to overload breakdown. the load is defined through edge betweenness centrality. We focus on the situation where the average number of connections per vertex is, as the number of vertices, linearly increasing in time. After an initial stage of growth, the network undergoes avalanching breakdowns to a fragmented state from which it never recovers. This breakdown is much less violent if the growth is by random rather than preferential attachment (as defines the Barabasi and Albert model). We briefly discuss the case where the average number of connections per vertex is constant. In this case no breakdown avalanches occur. Implications to the growth of real-world communication networks are discussed.

To appear in Phys. Rev. E

References in corpus (9)

• Community structure in social and biological networks
• Lethality and centrality in protein networks
• Attack vulnerability of complex networks
• Dynamical and correlation properties of the Internet
• The Web of Human Sexual Contacts
• Universal Behavior of Load Distribution in Scale-free Networks
• Instability of scale-free networks under node-breaking avalanches
• Vertex overload breakdown in evolving networks
• Truncation of power law behavior in "scale-free" network models due to information filtering

Cited by in corpus (29)

• The structure and function of 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
• Generalized Network Dismantling
• 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
• Performance of networks of artificial neurons: The role of clustering
• Extreme events in dynamical systems and random walkers: A review
• 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
• Effect of edge removal on topological and functional robustness of complex networks
• Protecting infrastructure networks from cost-based attacks
• The Forgiving Tree: A Self-Healing Distributed Data Structure
• Oscillations of complex networks
• A quantitative method for determining the robustness 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
• Xheal: Localized Self-healing using Expanders
• Structural instability of large-scale functional networks
• Dynamics on networks. Case of Heterogeneous Opinion Status Model
• Self-healing systems and virtual structures
• Multiple Vectors Propagation of Epidemics in Complex Networks