Kai Zhang, Yinghong Ma, "The Centrality Ranking Algorithm Based on the Network Structure," WSEAS Transactions on Information Science and Applications, vol. 13, pp. 93-104, 2016, DOI:
Kai Zhang, Yinghong Ma. The Centrality Ranking Algorithm Based on the Network Structure.
WSEAS Transactions on Information Science and Applications. 2016;13:93-104.
WSEAS Transactions on Information Science and Applications
Print ISSN: 1790-0832, E-ISSN: 2224-3402
Volume 13, 2016
The Centrality Ranking Algorithm Based on the Network Structure
Authors: ,
Abstract: Centrality is an important measurement of network structure. The node centrality ranking algorithm is to calculate the significant degree of nodes in social networks. An improved algorithm of ranking node centrality is present in this issue. Numerical simulation showed the feasibility and validity of the node centrality ranking algorithm, the convergence of the algorithm is proved by Perron-Frobenius Theorem. Comparing with the previous centrality algorithms, it exhibited more efficiency in computing complexity. Meanwhile, an edge centrality ranking algorithm and its efficiency is discussed too.
Pages: 93-104 WSEAS Transactions on Information Science and Applications, ISSN / E-ISSN: 1790-0832 / 2224-3402, Volume 13, 2016, Art. #10 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools