2007
DOI: 10.1016/j.physa.2006.05.049
|View full text |Cite
|
Sign up to set email alerts
|

Error and attack tolerance of evolving networks with local preferential attachment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
37
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
6
1
1

Relationship

3
5

Authors

Journals

citations
Cited by 56 publications
(40 citation statements)
references
References 20 publications
3
37
0
Order By: Relevance
“…2 that the degree of network heterogeneity grows with M and this result is also consistent with the very recent work of Sun et al [19]. All these results are averaged over 100 network implementations in Figs.…”
Section: Introductionsupporting
confidence: 90%
See 1 more Smart Citation
“…2 that the degree of network heterogeneity grows with M and this result is also consistent with the very recent work of Sun et al [19]. All these results are averaged over 100 network implementations in Figs.…”
Section: Introductionsupporting
confidence: 90%
“…The localworld model displays a transition from the exponential distribution to the power-law distribution and captures an important feature in the real-world network: preferential attachment mechanism that works only within a localworld instead of the whole network, such as communication networks, world trade web and biological networks [18]. A recent work [19] also indicates that numerous statistical characteristics of this model, such as clustering coefficient, diameter, efficiency, error and attack tolerance, are all closely correlated with local-world size (M). Is the epidemic spreading with time delay also related with this parameter?…”
Section: Introductionmentioning
confidence: 99%
“…Since the degree distributions in the carding social networks are lognormal, this means that there are less highly connected nodes and more moderately connected nodes [2]. This implies that the networks are more robust against targeted attacks than scale-free networks as well as more resilient against random node removals than random networks [26]. However, targeted attacks remain particularly suitable against carding social networks because they are disassortatively mixed, which means that high-and mediumdegree nodes (e.g.…”
Section: Implications and Discussionmentioning
confidence: 99%
“…In the first part, we evaluate the global network connectivity by measuring how many nodes can be disconnected from a network without disrupting the network. In the second part, we evaluate the local network connectivity and communication efficiency when a certain number of nodes leaving from the original global network [19].…”
Section: B a Methods To Construct A Bimodal Networkmentioning
confidence: 99%