Message Passing Optimization of Harmonic Influence Centrality

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 algo...

Full description

Bibliographic Details
Main Authors: Vassio, Luca (Author), Fagnani, Fabio (Author), Frasca, Paolo (Author), Ozdaglar, Asuman E. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2016-01-25T17:51:20Z.
Subjects:
Online Access:Get fulltext
LEADER 01381 am a22002173u 4500
001 100980
042 |a dc 
100 1 0 |a Vassio, Luca  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Laboratory for Information and Decision Systems  |e contributor 
100 1 0 |a Ozdaglar, Asuman E.  |e contributor 
700 1 0 |a Fagnani, Fabio  |e author 
700 1 0 |a Frasca, Paolo  |e author 
700 1 0 |a Ozdaglar, Asuman E.  |e author 
245 0 0 |a Message Passing Optimization of Harmonic Influence Centrality 
260 |b Institute of Electrical and Electronics Engineers (IEEE),   |c 2016-01-25T17:51:20Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/100980 
520 |a 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. 
546 |a en_US 
655 7 |a Article 
773 |t IEEE Transactions on Control of Network Systems