Betweenness centrality and Q-measures in directed valued networks

被引:25
|
作者
Rousseau, Ronald [1 ,2 ,3 ]
Zhang, Lin [3 ,4 ,5 ]
机构
[1] KHBO Assoc KU Leuven, Dept Ind Sci & Technol, B-8400 Oostende, Belgium
[2] Hasselt Univ UHasselt, Diepenbeek, Belgium
[3] Katholieke Univ Leuven, Steunpunt O&O Indicatoren, Louvain, Belgium
[4] Henan Normal Univ, Inst Sci Technol & Soc, Xinxiang, Peoples R China
[5] Dalian Univ Technol, WISE LAB, Dalian, Peoples R China
基金
中国国家自然科学基金;
关键词
Maximum Flow; Social Network Analysis; Betweenness Centrality; Citation Network; Directed Network;
D O I
10.1007/s11192-007-1772-2
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Q-measures express the bridging function of nodes in a network subdivided into two groups. An approach to Q-measures in the context of weighted or valued directed networks is proposed. This new approach uses flow centrality as the main concept. Simple examples illustrate the definition.
引用
下载
收藏
页码:575 / 590
页数:16
相关论文
共 50 条
  • [41] Fast Approximations of Betweenness Centrality with Graph Neural Networks
    Maurya, Sunil Kumar
    Liu, Xin
    Murata, Tsuyoshi
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 2149 - 2152
  • [42] Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks
    Yong Li
    Wenguo Li
    Yi Tan
    Fang Liu
    Yijia Cao
    Kwang Y. Lee
    Scientific Reports, 7
  • [43] Fully Dynamic Betweenness Centrality Maintenance on Massive Networks
    Hayashi, Takanori
    Akiba, Takuya
    Yoshida, Yuichi
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 9 (02): : 48 - 59
  • [44] Fast exact computation of betweenness centrality in social networks
    Baglioni, Miriam
    Geraci, Filippo
    Pellegrini, Marco
    Lastres, Ernesto
    2012 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2012, : 450 - 456
  • [45] Q-MEASURES ON THE DUAL UNIT BALL OF A JB*-TRIPLE
    Edwards, C. Martin
    Oliveira, Lina
    JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2019, 56 (01) : 197 - 224
  • [46] Approximation of Interactive Betweenness Centrality in Large Complex Networks
    Wandelt, Sebastian
    Shi, Xing
    Sun, Xiaoqian
    COMPLEXITY, 2020, 2020
  • [47] Centrality measures in networks
    Bloch, Francis
    Jackson, Matthew O.
    Tebaldi, Pietro
    SOCIAL CHOICE AND WELFARE, 2023, 61 (2) : 413 - 453
  • [48] DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs
    Chehreghani, Mostafa Haghir
    Bifet, Albert
    Abdessalem, Talel
    2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2018, : 2114 - 2123
  • [49] Centrality measures in networks
    Francis Bloch
    Matthew O. Jackson
    Pietro Tebaldi
    Social Choice and Welfare, 2023, 61 : 413 - 453
  • [50] A Clustered Approach for Fast Computation of Betweenness Centrality in Social Networks
    Suppa, Paolo
    Zimeo, Eugenio
    2015 IEEE INTERNATIONAL CONGRESS ON BIG DATA - BIGDATA CONGRESS 2015, 2015, : 47 - 54