Two-hop walks indicate PageRank order

作者：

Highlights：

• This paper opens a new door for studying PageRank based on the spectral distribution law of random matrices.

• We provide a method for pairwise comparisons in PageRank in O(1) without computing the exact value of the principle eigenvectors of Google matrices from a probabilistic view.

• We provide a method for extracting the top k list in O(kn), where n is the total number of involved items

摘要

•This paper opens a new door for studying PageRank based on the spectral distribution law of random matrices.•We provide a method for pairwise comparisons in PageRank in O(1) without computing the exact value of the principle eigenvectors of Google matrices from a probabilistic view.•We provide a method for extracting the top k list in O(kn), where n is the total number of involved items

论文关键词：Spectral ranking,PageRank,Two-Hop

论文评审过程：Received 18 February 2018, Revised 8 December 2018, Accepted 15 June 2019, Available online 17 June 2019, Version of Record 22 June 2019.

论文官网地址：https://doi.org/10.1016/j.patcog.2019.06.010