[2] Politecn Torino, Dipartimento Sci Matemat, I-10128 Turin, Italy
[3] Univ Twente, Dept Appl Math, NL-7522 NB Enschede, Netherlands
[4] MIT, LIDS, Cambridge, MA 02139 USA
来源:
2014 EUROPEAN CONTROL CONFERENCE (ECC)
|
2014年
关键词:
CENTRALITY;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
In this paper, we define a new measure of node centrality in social networks, the Harmonic Influence Centrality, which emerges naturally in the study of social influence over networks. Next, we introduce a distributed message passing algorithm to compute the Harmonic Influence Centrality of each node: its design is based on an intuitive analogy between social and electrical networks. Although our convergence analysis assumes the networks to have no cycle, the algorithm can be successfully applied on general graphs.