Efficiency of scale-free networks: Error and attack tolerance
From MaRDI portal
Abstract: The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e. networks with power law P(k), are considered: 1) scale-free networks with no local clustering produced by the Barabasi-Albert model and 2) scale-free networks with high clustering properties as in the model by Klemm and Eguiluz, and their properties are compared to the properties of random graphs (exponential graphs). By using as mathematical measures the global and the local efficiency we investigate the effects of errors and attacks both on the global and the local properties of the network. We show that the global efficiency is a better measure than the characteristic path length to describe the response of complex networks to external factors. We find that, at variance with random graphs, scale-free networks display, both on a global and on a local scale, a high degree of error tolerance and an extreme vulnerability to attacks. In fact, the global and the local efficiency are unaffected by the failure of some randomly chosen nodes, though they are extremely sensititive to the removal of the few nodes which play a crucial role in maintaining the network's connectivity.
Recommendations
Cites work
- scientific article; zbMATH DE number 1865707 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Exploring complex networks
- Harmony in the small-world
- Is the Boston subway a small-world network?
- Models of the small world.
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- Statistical mechanics of complex networks
Cited in
(41)- An efficient immunization strategy based on transmission limit in weighted complex networks
- The impact of dynamic events on the number of errors in networks
- Principles of Distributed Systems
- Efficient methods for the distance-based critical node detection problem in complex networks
- On the probability of facing random breakdowns: a measure of networks' vulnerability
- Complex Network analysis of the robustness of the Hanoi, Vietnam bus network
- Application of complex networks theory in urban traffic network researches
- Robustness of scale-free networks with dynamical behavior against multi-node perturbation
- Critical node detection problem for complex network in undirected weighted networks
- Complex networks: structure and dynamics
- New results on computable efficiency and its stability for complex networks
- On the Power of Planned Infections in Networks
- VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Emergent task differentiation on network filters
- Reducing the vulnerability of network by inserting modular topologies
- TOPOLOGICAL VULNERABILITY OF THE EUROPEAN POWER GRID UNDER ERRORS AND ATTACKS
- Dynamical resilience of networks against targeted attack
- On network similarities and their applications
- Integrating fluctuations into distribution of resources in transportation networks
- A key heterogeneous structure of fractal networks based on inverse renormalization scheme
- Efficiency of complex networks under failures and attacks: a percolation approach
- The effect of attacks on the railway network of Hungary
- Efficiency dynamics on scale-free networks with communities
- THE POWER FUNCTION HIDDEN IN THE VULNERABILITY OF FRACTAL COMPLEX NETWORKS
- Evolving efficiency and robustness of the international oil trade network
- How non-uniform tolerance parameter strategy changes the response of scale-free networks to failures
- Analytical relationships between metric and centrality measures of a network and its dual
- Information theory perspective on network robustness
- An approach for understanding and promoting coal mine safety by exploring coal mine risk network
- Effective measurement of network vulnerability under random and intentional attacks
- Asymptotic estimates for efficiency, vulnerability and cost for random networks
- Targeting attack hypergraph networks
- Robustness analysis of urban road networks from topological and operational perspectives
- The vertex attack tolerance of complex networks
- How the science of complex networks can help developing strategies against terrorism
- Tail risk in production networks
- Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
- Structural vulnerability and robustness in complex networks: different approaches and relationships between them
- Resilience of core-periphery networks in the case of rich-club
- \((\psi,p,q)\)-vulnerabilities: a unified approach to network robustness
This page was built for publication: Efficiency of scale-free networks: Error and attack tolerance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1859784)
