A Message Passing Algorithm for the Evaluation of Social Influence

被引：0
|
作者：
Vassio, Luca [1 ]
Fagnani, Fabio [2 ]
Frasca, Paolo [3 ]
Ozdaglar, Asuman [4 ]
机构：
[1] Politecn Torino, Dipartimento Ingn Meccan & Aerosp, I-10128 Turin, Italy
[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.
引用
收藏
页码：190 / 195
页数：6
相关论文
共 50 条
  • [1] On the Convergence of Message Passing Computation of Harmonic Influence in Social Networks
    Rossi, Wilbert Samuel
    Frasca, Paolo
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (02): : 116 - 129
  • [2] Heterogeneous message passing for heterogeneous networks
    Cantwell, George T.
    Kirkley, Alec
    Radicchi, Filippo
    PHYSICAL REVIEW E, 2023, 108 (03)
  • [3] Scalable Algorithm for Computing Influence Spreading Probabilities in Social Networks
    Ijas, Matias
    Levijoki, Janne
    Kuikka, Vesa
    PROCEEDINGS OF THE 5TH EUROPEAN CONFERENCE ON SOCIAL MEDIA (ECSM 2018), 2018, : 76 - 84
  • [4] An improved influence maximization method for social networks based on genetic algorithm
    Lotf, Jalil Jabari
    Azgomi, Mohammad Abdollahi
    Dishabi, Mohammad Reza Ebrahimi
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 586
  • [5] A dynamic algorithm based on cohesive entropy for influence maximization in social networks
    Li, Weimin
    Zhong, Kexin
    Wang, Jianjia
    Chen, Dehua
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 169
  • [6] A message-passing approach to obtain the trace of matrix functions with applications to network analysis
    Guzman, Grover Enrique Castro
    Stadler, Peter Florian
    Fujita, Andre
    NUMERICAL ALGORITHMS, 2025,
  • [7] CSR: A community based spreaders ranking algorithm for influence maximization in social networks
    Kumar, Sanjay
    Gupta, Aaryan
    Khatri, Inder
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2022, 25 (06): : 2303 - 2322
  • [8] Influence Maximization in social networks using discretized Harris' Hawks Optimization algorithm
    Khatri, Inder
    Choudhry, Arjun
    Rao, Aryaman
    Tyagi, Aryan
    Vishwakarma, Dinesh Kumar
    Prasad, Mukesh
    APPLIED SOFT COMPUTING, 2023, 149
  • [9] Hey, influencer! Message delivery to social central nodes in social opportunistic networks
    Borrego, Carlos
    Borrell, Joan
    Robles, Sergi
    COMPUTER COMMUNICATIONS, 2019, 137 : 81 - 91
  • [10] Authority updating: An expert authority evaluation algorithm considering post-evaluation and power indices in social networks
    Shi, Ruili
    Guo, Chunxiang
    Gu, Xin
    EXPERT SYSTEMS, 2021, 38 (01)
12345