# Parameters Affecting the Resilience of Scale-Free Networks to Random Failures

@article{Link2005ParametersAT, title={Parameters Affecting the Resilience of Scale-Free Networks to Random Failures}, author={Hamilton E. Link and Randall A. LaViolette and Jared Saia and Terran Lane}, journal={ArXiv}, year={2005}, volume={abs/cs/0511012} }

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free… Expand

#### 5 Citations

Topological resilience of complex networks against failure and attack

- Engineering, Computer Science
- 2011 Fifth IEEE International Conference on Advanced Telecommunication Systems and Networks (ANTS)
- 2011

The small-world network is found to have the best resilience compared to others because of its highly clustered feature and the results help one gain a better understanding of the field. Expand

Controlling across complex networks - Emerging links between networks and control

- Computer Science, Engineering
- Annu. Rev. Control.
- 2008

This chapter reviews the tools from the network theorist arsenal to make them available to control engineers, and describes how ideas developed for complex network research can be exploited within a control systems framework. Expand

The Impact of Social Networks on Multi-Agent Recommender Systems

- Computer Science
- ArXiv
- 2005

It is shown that in many cases DRSs will be useful for sharing information in a multi-agent learning system, and it is concluded that given an appropriate network, the communication network reduces the number of sampled items, thenumber of messages sent, and the amount of ``spam. Expand

A framework for Web object self-preservation

- Computer Science
- 2014

A framework based on emergent behavior principles for the long-term preservation of digital data using the web infrastructure is proposed and developed and a reference implementation of the unsupervised small-world (USW) algorithm is developed that is believed to create a connected network of WOs based on the internet infrastructure that will outlive the people and institutions that created the WOs. Expand

CONTROLLING ACROSS COMPLEX NETWORKS: EMERGING LINKS BETWEEN NETWORKS AND CONTROL

- Engineering
- 2007

The presence of communication networks in the feedback path of a control system has led to new problems for control designers. Meanwhile, physicists, computer scientists, and mathematicians have been… Expand

#### References

SHOWING 1-10 OF 33 REFERENCES

Breakdown of the internet under intentional attack.

- Physics, Medicine
- Physical review letters
- 2001

It is argued that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as square root of [M], rather than as log (k)M, as expected for random networks away from criticality. Expand

Resilience of the internet to random breakdowns

- Physics, Medicine
- Physical review letters
- 2000

This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99. Expand

Statistical mechanics of complex networks

- Computer Science, Physics
- ArXiv
- 2001

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. Expand

On power-law relationships of the Internet topology

- Computer Science
- SIGCOMM '99
- 1999

These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes. Expand

A Random Graph Model for Power Law Graphs

- Mathematics, Computer Science
- Exp. Math.
- 2001

A random graph model is proposed which is a special case of sparserandom graphs with given degree sequences which satisfy a power law and involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs. Expand

Collective dynamics of ‘small-world’ networks

- Computer Science, Medicine
- Nature
- 1998

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand

Mixing patterns in networks.

- Mathematics, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2003

This work proposes a number of measures of assortative mixing appropriate to the various mixing types, and applies them to a variety of real-world networks, showing that assortsative mixing is a pervasive phenomenon found in many networks. Expand

A random graph model for massive graphs

- Mathematics, Computer Science
- STOC '00
- 2000

A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs. Expand

The Size of the Giant Component of a Random Graph with a Given Degree Sequence

- Mathematics, Computer Science
- Comb. Probab. Comput.
- 1998

The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i. Expand

Maximizing the spread of influence through a social network

- Computer Science
- KDD '03
- 2003

An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks. Expand