An Approximate Flow Betweenness Centrality Measure for Complex Network

被引：9

作者：

Liu, Jia-Rui ^{[1
]}

Guo, Shi-Ze ^{[2
]}

Lu, Zhe-Ming ^{[1
]}

Yu, Fa-Xin ^{[1
]}

Li, Hui ^{[1
]}

机构：

[1] Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Zhejiang, Peoples R China

[2] North Elect Syst Engn Corp, Beijing 100083, Peoples R China

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2013年 / E96D卷 / 03期

基金：

中国国家自然科学基金;

关键词：

complex network; centrality; flow betweenness centrality; approximate flow betweenness centrality;

D O I：

10.1587/transinf.E96.D.727

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In complex network analysis, there are various measures to characterize the centrality of each node within a graph, which determines the relative importance of each node. The more centrality a node has in a network, the more significance it has in the spread of infection. As one of the important extensions to shortest-path based betweenness centrality, the flow betweenness centrality is defined as the degree to which each node contributes to the sum of maximum flows between all pairs of nodes. One of the drawbacks of the flow betweenness centrality is that its time complexity is somewhat high. This Letter proposes an approximate method to calculate the flow betweenness centrality and provides experimental results as evidence.

引用

页码：727 / 730

页数：4