Home > Papers

 
 
A centrality measure of complex networks based on information flow
CHEN Guoqiang 1 *,WANG Yuping 2
1. School of Computer Science and Technology, Xidian University, Xi'an 710071, China.
2.School of Computer Science and Technology, Xidian University, Xi'an 710071, China.
*Correspondence author
#Submitted by
Subject:
Funding: National Natural Science Foundation of China under Grant（No. No. 60873099）
Opened online:12 March 2012
Accepted by: none
Citation: CHEN Guoqiang,WANG Yuping.A centrality measure of complex networks based on information flow[OL]. [12 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4468479
 
 
A new centrality measure for complex networks, called information flow centrality, is proposed in this paper. This centrality measure is based on the concept of the information flow in networks. It can be applicable to not only the connect networks, but also the disconnect networks. Moreover, it overcomes some disadvantages of several often used centrality measures. The performance of the proposed measure is compared with the standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonable.
Keywords:Centrality measures; Information flow centrality; Complex networks
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 314
Bookmarked 0
Recommend 5
Comments Array
Submit your papers