On the Exponential Ranking and Its Linear Counterpart
COMPLEX NETWORKS & THEIR APPLICATIONS X, VOL 1(2022)
摘要
This paper deals with ranking algorithms for signed graphs. We analyze the algebraic properties of the exponential ranking algorithm and suggest an alternative ranking scheme that is close to the exponential ranking in several respects, but which also enjoys the property of being linear. We discuss the properties of the introduced scheme and present both algebraic and numerical evidence that it is indeed very close to the exponential ranking.
更多查看译文
关键词
Signed networks, Ranking, Exponential ranking, Kendall's tau, Rank correlation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要