Remarks on lumping PageRank results of Ipsen and Selee

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