Comments on lumping the Google matrix

07/23/2021

∙

by   Yongxin Dong, et al.

∙

0

∙

share

On the case that the number of dangling nodes is large, PageRank computation can be proceeded with a much smaller matrix through lumping all dangling nodes of a web graph into a single node. Thus, it saves many computational cost and operations. In this note, we provide alternative proofs for lumpable PageRank results of Ipsen and Selee.