Vulnerability of complex networks under intentional attack with incomplete information

@inproceedings{Wu2007VulnerabilityOC,
  title={Vulnerability of complex networks under intentional attack with incomplete information},
  author={Jingjing Wu and Hongzhong Deng and Yuejin Tan and Da-Zhi Zhu},
  year={2007}
}
We study the vulnerability of complex networks under intentional attack with incomplete information, which means that one can only preferentially attack the most important nodes among a local region of a network. The known random failure and the intentional attack are two extreme cases of our study. Using the generating function method, we derive the exact value of the critical removal fraction fc of nodes for the disintegration of networks and the size of the giant component. To validate our… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 31 CITATIONS

Robustness of Networks with Skewed Degree Distributions under Strategic Node Protection

  • 2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC)
  • 2016
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Efficient attack strategy to communication networks with partial degree information

  • 2011 IEEE International Symposium of Circuits and Systems (ISCAS)
  • 2011
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Variance-Constrained State Estimation for Complex Networks With Randomly Varying Topologies

  • IEEE Transactions on Neural Networks and Learning Systems
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND