Message Passing Optimization of Harmonic Influence Centrality

被引：37

作者：

Vassio, Luca ^{[1
]}

Fagnani, Fabio ^{[2
]}

Frasca, Paolo ^{[3
]}

Ozdaglar, Asuman ^{[4
]}

机构：

[1] Politecn Torino, Dipartimento Ingn Meccan Aerospaziale, I-10129 Turin, Italy

[2] Politecn Torino, Dipartimento Sci Matemat, I-10129 Turin, Italy

[3] Univ Twente, Dept Appl Math, NL-7522 NB Enschede, Netherlands

[4] MIT, Lab Informat & Decis Syst, Cambridge, MA 02139 USA

来源：

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS | 2014年 / 1卷 / 01期

关键词：

Centrality measures; distributed algorithms; message passing; opinion dynamics; social networks;

D O I：

10.1109/TCNS.2014.2304870

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper proposes a new measure of node centrality in social networks, the Harmonic Influence Centrality (HIC), which emerges naturally in the study of social influence over networks. Using an intuitive analogy between social and electrical networks, we introduce a distributed message passing algorithm to compute the HIC of each node. Although its design is based on theoretical results which assume the network to have no cycle, the algorithm can also be successfully applied on general graphs.

引用

页码：109 / 120

页数：12

共 15 条

[1] Opinion Fluctuations and Disagreement in Social Networks [J].

Acemoglu, Daron ;

Como, Giacomo ;

Fagnani, Fabio ;

Ozdaglar, Asuman .

MATHEMATICS OF OPERATIONS RESEARCH, 2013, 38 (01) :1-27

[2] Statistical mechanics of complex networks [J].

Albert, R ;

Barabási, AL .

REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97

[3]

BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631

[4] Survey propagation:: An algorithm for satisfiability [J].

Braunstein, A ;

Mézard, M ;

Zecchina, R .

RANDOM STRUCTURES & ALGORITHMS, 2005, 27 (02) :201-226

[5]

Estrada E, 2010, NETWORK SCIENCE: COMPLEXITY IN NATURE AND TECHNOLOGY, P13, DOI 10.1007/978-1-84996-396-1_2

[6] THEORETICAL FOUNDATIONS FOR CENTRALITY MEASURES [J].

FRIEDKIN, NE .

AMERICAN JOURNAL OF SOCIOLOGY, 1991, 96 (06) :1478-1504

[7]

Gallager R., 1962, IEEE T INFORM THEORY, P1

[8] Distributed Randomized Algorithms for the PageRank Computation [J].

Ishii, Hideaki ;

Tempo, Roberto .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2010, 55 (09) :1987-2002

[9]

Mezard M., 2009, INFORM PHYS COMPUTAT, DOI DOI 10.1093/ACPROF:OSO/9780198570837.001.0001

[10] A measure of betweenness centrality based on random walks [J].

Newman, MEJ .

SOCIAL NETWORKS, 2005, 27 (01) :39-54

← 1 2 →