2003
DOI: 10.1016/s0378-4371(02)01545-5
|View full text |Cite
|
Sign up to set email alerts
|

Efficiency of scale-free networks: error and attack tolerance

Abstract: The concept of network e ciency, recently proposed to characterize the properties of smallworld networks, is here used to study the e ects of errors and attacks on scale-free networks. Two di erent 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 Eguà luz, and their properties are compared to the properti… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
244
0
3

Year Published

2005
2005
2016
2016

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 399 publications
(250 citation statements)
references
References 27 publications
3
244
0
3
Order By: Relevance
“…The degree distribution, P(k), is the probability that a node has exactly k links. Another measure related to average path length is the network's global efficiency, which is defined as the average of the inverses of shortest path lengths over all pairs of nodes in a network (Crucitti et al, 2003). It is shown that a random network usually has a small average path length and is more efficient because an arbitrary node can reach any other node in a few steps.…”
Section: Network Analysismentioning
confidence: 99%
“…The degree distribution, P(k), is the probability that a node has exactly k links. Another measure related to average path length is the network's global efficiency, which is defined as the average of the inverses of shortest path lengths over all pairs of nodes in a network (Crucitti et al, 2003). It is shown that a random network usually has a small average path length and is more efficient because an arbitrary node can reach any other node in a few steps.…”
Section: Network Analysismentioning
confidence: 99%
“…This is because the geographical correlation that is present amongst stress centers results in substantial geographically correlated link failures, thereby lowering reliability. In studying the network efficiency, we have adopted the global efficiency metric defined in [19]. The results of the global efficiency of the network are presented in Fig.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…2 are used as guidance indices. For vulnerability indices, several metrics have been proposed to evaluate the completeness of the network in the literatures, the frequently used ones including the relative size of giant component, efficiency, and the average geodesic distance [14], [15]. In this Letter, we use the relative size of giant component to measure the vulnerability of power grids.…”
Section: Structural Vulnerability Analysis Of Power Grids Guided By Cmentioning
confidence: 99%