The PageRank model of minimal irreducible adjustment and its lumping method
In this paper, based on the original PageRank model with usual adjustment and computation, we propose a minimal irreducible adjustment model of PageRank. It is proved that the solution of this model is unique. Furthermore, an effective blocking and lumping algorithm is used for speeding up the process of obtaining this solution. Three numerical examples are given to verify the argues being correct and proper.
pagerank model minimal irreducibility google matrix dangling nodes nondangling nodes vector 65f10 65b99