Link transmission centrality in large-scale social networks

被引:4
|
作者
Zhang, Qian [1 ]
Karsai, Marton [1 ,2 ]
Vespignani, Alessandro [1 ]
机构
[1] Northeastern Univ, Lab Modeling Biol & Sociotech Syst, Boston, MA 02115 USA
[2] UCB Lyon 1, CNRS, INRIA, LIP UMR 5668,IXXI,Univ Lyon,ENS Lyon, Lyon, France
关键词
Social networks; Link centrality measures; Diffusion processes; Weak tie; BETWEENNESS CENTRALITY; COMPLEX; IDENTIFICATION; WEAKNESS; NODES; TIES;
D O I
10.1140/epjds/s13688-018-0162-8
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Understanding the importance of links in transmitting information in a network can provide ways to hinder or postpone ongoing dynamical phenomena like the spreading of epidemic or the diffusion of information. In this work, we propose a new measure based on stochastic diffusion processes, the transmission centrality, that captures the importance of links by estimating the average number of nodes to whom they transfer information during a global spreading diffusion process. We propose a simple algorithmic solution to compute transmission centrality and to approximate it in very large networks at low computational cost. Finally we apply transmission centrality in the identification of weak ties in three large empirical social networks, showing that this metric outperforms other centrality measures in identifying links that drive spreading processes in a social network.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Link transmission centrality in large-scale social networks
    Qian Zhang
    Márton Karsai
    Alessandro Vespignani
    [J]. EPJ Data Science, 7
  • [2] Ranking of closeness centrality for large-scale social networks
    Okamoto, Kazuya
    Chen, Wei
    Li, Xiang-Yang
    [J]. FRONTIERS IN ALGORITHMICS, 2008, 5059 : 186 - +
  • [3] Sampling Based Katz Centrality Estimation for Large-Scale Social Networks
    Lin, Mingkai
    Li, Wenzhong
    Nguyen, Cam-tu
    Wang, Xiaoliang
    Lu, Sanglu
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2019, PT II, 2020, 11945 : 584 - 598
  • [4] SAKE: Estimating Katz Centrality Based on Sampling for Large-Scale Social Networks
    Lin, Mingkai
    Li, Wenzhong
    Song, Lynda J.
    Nguyen, Cam-Tu
    Wang, Xiaoliang
    Lu, Sanglu
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2021, 15 (04)
  • [5] Large-scale access scheduling in wireless mesh networks using social centrality
    Wu, Di
    Bao, Lichun
    Regan, Amelia C.
    Talcott, Carolyn L.
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2013, 73 (08) : 1049 - 1065
  • [6] Discovering Social Bursts by Using Link Analytics on Large-Scale Social Networks
    Jung, Jai E.
    [J]. MOBILE NETWORKS & APPLICATIONS, 2017, 22 (04): : 625 - 633
  • [7] Discovering Social Bursts by Using Link Analytics on Large-Scale Social Networks
    Jai E. Jung
    [J]. Mobile Networks and Applications, 2017, 22 : 625 - 633
  • [8] Logarithmic Gravity Centrality for Identifying Influential Spreaders in Dynamic Large-scale Social Networks
    Niu, Jianwei
    Yang, Haifeng
    Wang, Lei
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [9] A parallel approach to link sign prediction in large-scale online social networks
    [J]. Han, L. (lixinhan2002@hotmail.com), 1600, Oxford University Press (57):
  • [10] A Parallel Approach to Link Sign Prediction in Large-Scale Online Social Networks
    Zhou, Jiufeng
    Han, Lixin
    Yao, Yuan
    Zeng, Xiaoqin
    Xu, Feng
    [J]. COMPUTER JOURNAL, 2014, 57 (07): : 1092 - 1104