Betweenness centrality and Q-measures in directed valued networks

被引：0
作者：
Ronald Rousseau
Lin Zhang
机构：
[1] KHBO (Association K.U.Leuven),Department of Industrial Sciences and Technology
[2] Hasselt University (UHasselt),K.U. Leuven
[3] Steunpunt O&O Indicatoren,Institute for Science, Technology and Society
[4] Henan Normal University,WISE LAB
[5] Dalian University of Technology,undefined
来源：
Scientometrics | 2008年 / 75卷
关键词：
Maximum Flow; Social Network Analysis; Betweenness Centrality; Citation Network; Directed Network;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：15
相关论文
共 32 条
[1]  
Coffman T. R.(2004)Dynamic classification of groups through social network analysis and HMMs 2004 IEEE Aerospace Conference Proceedings 5 3197-3205
[2]  
Marcus S. E.(2004)A new measure of linkage between two sub-networks Connections 26 62-70
[3]  
Flom P. L.(1977)A set of measures of centrality based on betweenness Sociometry 40 35-41
[4]  
Friedman S. R.(1979)Centrality in social networks: I. Conceptual clarification Social Networks 1 215-239
[5]  
Strauss S.(1991)Centrality in valued graphs: a measure of betweenness based on network flow Social networks 13 141-154
[6]  
Neaigus A.(2002)Community structure in social and biological networks Proceedings of the National Academy of Sciences 99 7821-7826
[7]  
Freeman L. C.(2002)Mapping networks of terrorist cells Connections 24 43-52
[8]  
Freeman L. C.(2004)Author productivity and geodesic distance in bibliographic co-authorship networks and visibility on the Web Scientometrics 60 409-420
[9]  
Freeman L. C.(2007)Mapping interdisciplinarity at the interfaces between the Science Citation Index and the Social Science Citation Index Scientometrics 71 391-405
[10]  
Borgatti S. P.(2005)Minimum spanning trees on weighted scale-free networks Europhysics Letters 72 308-314
1234