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 …

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 …

The dangling nodes is the nodes with no out-links in the web graph. It saves many computational cost and operations provided the dangling nodes are lumped into one node. In this paper, motivated by so many dangling nodes in web graph, we develop theoretical results for HITS by the lumping …