An Adaptive Reordered Method for Computing PageRank

Abstract EN

We propose an adaptive reordered method to deal with the PageRank problem.

It has been shown that one can reorder the hyperlink matrix of PageRank problem to calculate a reduced system and get the full PageRank vector through forward substitutions.

This method can provide a speedup for calculating the PageRank vector.

We observe that in the existing reordered method, the cost of the recursively reordering procedure could offset the computational reduction brought by minimizing the dimension of linear system.

With this observation, we introduce an adaptive reordered method to accelerate the total calculation, in which we terminate the reordering procedure appropriately instead of reordering to the end.

Numerical experiments show the effectiveness of this adaptive reordered method.