Degree Centrality Based on theWeighted Network
Node centrality has been widely studied in the complex networks. In 2010, the model of node centrality under the weighted network was obtained by Tore Opashl et al. Tie weights and the number of ties were connected with certain proportion by tuning parameter in the model. However, the proportion is random measure. In this paper, the selection standard of the optimal turning parameters is proposed. In the proposed method, the maximum degree centrality of node can be emphasized. The numerical example of weighted network on optimal value selection is used to show the efficiency of the method.
Degree centrality Tuning parameter Weighted network
Daijun Wei Ya Li Yajuan Zhang Yong Deng
School of Computer and Information Science, Southwest University, Chongqing, 400715, China School of School of Computer and Information Science, Southwest University, Chongqing, 400715, China
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
3993-3996
2012-05-23（万方平台首次上网日期，不代表论文的发表时间）