Degree centrality based on the weighted 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.