An Approximate Flow Betweenness Centrality Measure for Complex Network
スポンサーリンク
概要
- 論文の詳細を見る
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.
著者
-
Lu Zhe-ming
School Of Aeronautics And Astronautics Zhejiang University
-
Yu Fa-xin
School Of Aeronautics And Astronautics Zhejiang University
-
GUO Shi-Ze
North Electronic Systems Engineering Corporation
-
LIU Jia-Rui
School of Aeronautics and Astronautics, Zhejiang University
-
LI Hui
School of Aeronautics and Astronautics, Zhejiang University
関連論文
- Empirical-Statistics Analysis for Zero-Failure GaAs MMICs Life Testing Data
- Color Image Retrieval Based on Distance-Weighted Boundary Predictive Vector Quantization Index Histograms
- DEGREE-DEGREE CORRELATION MEASURES AND CLUSTERING COEFFICIENTS FOR DIRECTED COMPLEX NETWORK ANALYSIS
- Strength-Strength and Strength-Degree Correlation Measures for Directed Weighted Complex Network Analysis
- A Tree-Structured Deterministic Small-World Network
- Circuit partitioning based fingerprinting method for IP protection
- Image Retrieval Based on Structured Local Binary Kirsch Pattern
- Reversible Data Hiding for BTC-Compressed Images Based on Lossless Coding of Mean Tables
- An Approximate Flow Betweenness Centrality Measure for Complex Network
- Random Walks on Stochastic and Determinmistic Small-World Networks