Lightweight centrality measures in networks under attack

Giorgos Georgiadis, Lefteris Kirousis

Research output: Contribution to journalArticlepeer-review


In this paper we study deliberate attacks on the infrastructure of large scale-free networks. These attacks are based on the importance of individual vertices in the network in order to be successful, and the concept of centrality (originating from social science) has already been utilized in their study with success. Some measures of centrality however, as betweenness, have disadvantages that do not facilitate the research in this area. We show that with the aid of scale-free network characteristics such as the clustering coefficient we can get results that balance the current centrality measures, but also gain insight into the workings of these networks.

Original languageEnglish (US)
Pages (from-to)147-157
Number of pages11
Issue number1-3
StatePublished - Aug 2006


  • Centrality
  • Clustering coefficient
  • Network attack
  • Scale-free networks, dynamics

ASJC Scopus subject areas

  • Genetics
  • General Agricultural and Biological Sciences


Dive into the research topics of 'Lightweight centrality measures in networks under attack'. Together they form a unique fingerprint.

Cite this