The identification of influential nodes based on structure similarity
The identification of influential nodes in complex networks is an open issue. To address it, many centrality measures have been proposed, among which the most representative iteration algorithm is the PageRank algorithm. However, it ignores the correlation between nodes and assumes that the jumping...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2021-04-01
|
Series: | Connection Science |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/09540091.2020.1806203 |