A survey on network node ranking algorithms:Representative methods,extensions,and applications  

作　　者：LIU JiaQi LI XueRong DONG JiChang 

机构地区：[1]School of Economics and Management,University of Chinese Academy of Sciences,Beijing 100190,China [2]Academy of Mathematics and Systems Science,Chinese Academy of Sciences,Beijing 100190,China

出　　处：《Science China(Technological Sciences)》2021年第3期451-461,共11页中国科学（技术科学英文版）

基　　金：the National Natural Science Foundation of China(Grant No.71901205)。

摘　　要：The ranking of network node importance is one of the most essential problems in the field of network science.Node ranking algorithms serve as an essential part in many application scenarios such as search engine,social networks,and recommendation systems.This paper presents a systematic review on three representative methods:node ranking based on centralities,Page Rank algorithm,and HITS algorithm.Furthermore,we investigate the latest extensions and improvements of these representative methods,provided with several main application fields.Inspired by the survey of current literature,we attempt to propose promising directions for future research.The conclusions of this paper are enlightening and beneficial to both the academic and industrial communities.

关 键 词：complex networks node ranking methods Page Rank HITS algorithms 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP393.0[自动化与计算机技术—控制科学与工程]