# Comment on "breakdown of the Internet under intentional attack".

@article{Dorogovtsev2001CommentO,
title={Comment on "breakdown of the Internet under intentional attack".},
author={Sergey N. Dorogovtsev and Jos{\'e} F. F. Mendes},
journal={Physical review letters},
year={2001},
volume={87 21},
pages={
219801
}
}
• Published 5 September 2001
• Physics
• Physical review letters
We obtain the exact position of the percolation threshold in intentionally damaged scale-free networks.
Attack Strategies on Complex Networks
• Mathematics, Computer Science
International Conference on Computational Science
• 2006
This work estimates the resilience of scale-free networks on a number of different attack methods and presents a class of real-life networks that prove to be very resilient on intentional attacks, or equivalently much more difficult to immunize completely than most model scale- free networks.
Random graph dynamics
The Erdos-Renyi random graphs model, a version of the CHKNS model, helps clarify the role of randomness in the distribution of values in the discrete-time world.
Effects of node protections against intentional attack in complex communication networks
• Computer Science
2011 8th International Workshop on the Design of Reliable Communication Networks (DRCN)
• 2011
It is shown that though different schemes have different effects, overall speaking protecting a small fraction of high-degree nodes or even medium-degree ones significantly enhances network robustness.
Entropy Weight Method for Evaluation of Invulnerability in Instant Messaging Network
• Computer Science
2009 Fourth International Conference on Internet Computing for Science and Engineering
• 2009
The paper analyzes the current measure methods of complex network invulnerability, measures the reliability and the invulnerability of instant messaging network topology by analytic hierarchy process, and constructs the evaluation index matrix.
Potts model on complex networks
• Physics
• 2004
Abstract.We consider the general p-state Potts model on random networks with a given degree distribution (random Bethe lattices). We find the effect of the suppression of a first order phase
Parameters Affecting the Resilience of Scale-Free Networks to Random Failures
• Computer Science
ArXiv
• 2005
It is shown that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9.
Scalability and Egalitarianism in Peer-to-Peer Networks
• Computer Science
• 2016
This chapter investigates the physical limits of distributed consensus mechanisms over networks, and discusses whether there are scalability and efficiency reasons that incentivize centralization.
Vulnerability of robust preferential attachment networks
• Computer Science
• 2013
A class of preferential attachment networks in the robust regime is analysed and it is proved that the critical proportion of nodes that have to be retained for survival of the giant component undergoes a steep increase as $\varepsilon$ moves away from zero, and the existence of two different universality classes of robust network models is revealed.
Impact of random failures and attacks on Poisson and power-law random networks
• Computer Science
ACM Comput. Surv.
• 2011
The conclusion is that the basic results are clearly important, but in practice much less striking than generally thought, and the differences between random failures and attacks are not so huge and can be explained with simple facts.