Betweenness centrality and Q-measures in directed valued networks

被引：26
|
作者：
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
来源：
SCIENTOMETRICS | 2008年 / 75卷 / 03期
基金：
中国国家自然科学基金;
关键词：
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 条
  • [31] Betweenness Centrality and Resistance Distance in Communication Networks
    Tizghadam, Ali
    Leon-Garcia, Alberto
    IEEE NETWORK, 2010, 24 (06): : 10 - 16
  • [32] Efficient Estimation of Betweenness Centrality in Wireless Networks
    Chan-Myung Kim
    Yong-hwan Kim
    Youn-Hee Han
    Jeong-Hyon Hwang
    Mobile Networks and Applications, 2016, 21 : 469 - 481
  • [33] An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality
    Yoon, Jeongah
    Blumer, Anselm
    Lee, Kyongbum
    BIOINFORMATICS, 2006, 22 (24) : 3106 - 3108
  • [34] Betweenness Centrality in Dense Random Geometric Networks
    Giles, Alexander P.
    Georgiou, Orestis
    Dettmann, Carl P.
    2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015, : 6450 - 6455
  • [35] Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
    Chehreghani, Mostafa Haghir
    Bifet, Albert
    Abdessalem, Talel
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 219 - 242
  • [36] Centrality in Directed Networks
    Marmulla, Gordana
    Brandes, Ulrik
    SOCIAL NETWORKS ANALYSIS AND MINING, ASONAM 2024, PT II, 2025, 15212 : 254 - 263
  • [37] Gauging the Bridging Function of Nodes in a Network: Q-measures for Networks with a Finite Number of Subgroups
    Guns, Raf
    Rousseau, Ronald
    PROCEEDINGS OF ISSI 2009 - 12TH INTERNATIONAL CONFERENCE OF THE INTERNATIONAL SOCIETY FOR SCIENTOMETRICS AND INFORMETRICS, VOL 1, 2009, 1 : 131 - 142
  • [38] Two betweenness centrality measures based on Randomized Shortest Paths
    Ilkka Kivimäki
    Bertrand Lebichot
    Jari Saramäki
    Marco Saerens
    Scientific Reports, 6
  • [39] Compressive sensing of high betweenness centrality nodes in networks
    Mahyar, Iamidreza
    Hasheminezhad, Rouzbeh
    Ghalebi, Elahe K.
    Nazemian, Ali
    Grosu, Radu
    Movaghar, Ali
    Rabiee, Hamid R.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 497 : 166 - 184
  • [40] Two betweenness centrality measures based on Randomized Shortest Paths
    Kivimaki, Ilkka
    Lebichot, Bertrand
    Saramaki, Jari
    Saerens, Marco
    SCIENTIFIC REPORTS, 2016, 6
12345