, Volume 42, Issue 1-2, pp 297-308

The PageRank model of minimal irreducible adjustment and its lumping method

Purchase on Springer.com

$39.95 / €34.95 / £29.95*

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.