Analyzing complex networks through correlations in centrality measurements

被引:34
作者
Furlan Ronqui, Jose Ricardo [1 ]
Travieso, Gonzalo [1 ]
机构
[1] Univ Sao Paulo, Inst Fis Sao Carlos, BR-05508070 Sao Paulo, Brazil
关键词
random graphs; networks; INFORMATION; COMMUNITY; REAL;
D O I
10.1088/1742-5468/2015/05/P05030
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
Many real world systems can be expressed as complex networks of interconnected nodes. It is frequently important to be able to quantify the relative importance of the various nodes in the network, a task accomplished by defining some centrality measures, with different centrality definitions stressing different aspects of the network. It is interesting to know to what extent these different centrality definitions are related for different networks. In this work, we study the correlation between pairs of a set of centrality measures for different real world networks and two network models. We show that the centralities are in general correlated, but with stronger correlations for network models than for real networks. We also show that the strength of the correlation of each pair of centralities varies from network to network. Taking this fact into account, we propose the use of a centrality correlation profile, consisting of the values of the correlation coefficients between all pairs of centralities of interest, as a way to characterize networks. Using the yeast protein interaction network as an example we show also that the centrality correlation profile can be used to assess the adequacy of a network model as a representation of a given real network.
引用
收藏
页数:15
相关论文
共 51 条
[1]   Principal component analysis [J].
Abdi, Herve ;
Williams, Lynne J. .
WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2010, 2 (04) :433-459
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]  
[Anonymous], ADV INTELLIGENT SYST
[4]  
Avrachenkov Konstantin, 2013, Algorithms and Models for the Web Graph. 10th International Workshop, WAW 2013. Proceedings: LNCS 8305, P106, DOI 10.1007/978-3-319-03536-9_9
[5]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[6]   Total communicability as a centrality measure [J].
Benzi, Michele ;
Klymko, Christine .
JOURNAL OF COMPLEX NETWORKS, 2013, 1 (02) :124-149
[8]  
BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631
[9]   Centrality and network flow [J].
Borgatti, SP .
SOCIAL NETWORKS, 2005, 27 (01) :55-71
[10]   A graph-theoretic perspective on centrality [J].
Borgatti, Stephen P. ;
Everett, Martin G. .
SOCIAL NETWORKS, 2006, 28 (04) :466-484