# Message passing optimization of Harmonic Influence Centrality

arXiv: https://arxiv.org/abs/1310.0005 · HTML: https://mlsanity.com/paper/1310.0005/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Sep 2013.

## Built on by (most cited first, 1 of 1)

- [Optimizing Influence Campaigns: Nudging under Bounded Confidence](https://mlsanity.com/paper/2503.18331/) (2025)

## Abstract (arXiv)

This paper proposes a new measure of node centrality in social networks, the Harmonic Influence Centrality, 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 Harmonic Influence Centrality 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.