Controlling centrality in complex networks

• Published in: Scientific reports Vol. 2; no. 1; p. 218
• Main Authors: Nicosia, V., Criado, R., Romance, M., Russo, G., Latora, V.
• Format: Journal Article
• Language: English
• Published: London Nature Publishing Group UK 11.01.2012; Nature Publishing Group
• Subjects: 639/766/25; 639/766/483/640; 639/766/530; Humanities and Social Sciences; multidisciplinary; Nodes; Physics; Science; Social networks
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/srep00218

Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by popularity and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We show that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We found that many large networks from the real world have surprisingly small controlling sets, containing even less than 5 – 10% of the nodes.