Scale-free networks resistant to intentional attacks

  title={Scale-free networks resistant to intentional attacks},
  author={Lazaros K. Gallos and Panos Argyrakis},
We study the detailed mechanism of the failure of scale-free networks under intentional attacks. Although it is generally accepted that such networks are very sensitive to targeted attacks, we show that for a particular type of structure such networks surprisingly remain very robust even under removal of a large fraction of their nodes, which in some cases can be up to 70%. The degree distribution P(k) of these structures is such that for small values of the degree k the distribution is… Expand

Figures and Tables from this paper

Non massive immunization to contain spreading on complex networks
It is reported that moderate and weakly supervised immunizations can lead to finite epidemic thresholds of the susceptible-infected-susceptible model on scale-free networks by changing the nature of the transition from a specific motif to a collectively driven process. Expand
A new information dimension of complex network based on Rényi entropy
Abstract With the development of high technology and artificial intelligence, it evolves into an open issue to calculate the dimension of the complex network. In this paper, a new dimension — RenyiExpand
Today, thanks to rapid advances in IT, we have available substantial datasets pertaining both to the extent and the structure of knowledge production across disciplines, space and time. EspeciallyExpand
Body Height and Occupational Success for Actors and Actresses
Compared to the general population, actors and actresses were significantly taller; however, actresses who were shorter than average were more likely to achieve greater occupational success, in terms of being featured in more movies. Expand


Breakdown of the internet under intentional attack.
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
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
Network robustness and fragility: percolation on random graphs.
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree. Expand
  • R. Rosenfeld
  • Medicine
  • Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery
  • 2009
I am writing with a simple plea to balance the voluminous articles about treatment in your journal with a modicum of information about nature and caring effects to rekindle the perception of physicians as healers, not only treaters, who relish the gifts of nature, and foster the humanistic aspect of medicine that has thrived for millennia. Expand
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 2000
Phys. Rev. E
  • Phys. Rev. E
  • 2005
Eur. Phys. J. B
  • Eur. Phys. J. B
  • 2004
Soc. Netw
  • Soc. Netw
  • 2004
Soc. Networks
  • Soc. Networks
  • 2004
Rev. Mod. Phys
  • Rev. Mod. Phys
  • 2002