Highlighted notes on:
Incremental Page Rank Computation on Evolving Graphs.
While doing research work with:
Prof. Dip Sankar Banerjee and Prof. Kishore Kothapalli:
https://dl.acm.org/doi/10.1145/1062745.1062885
This paper describes a simple method for computing dynamic pagerank, based on the fact that change of out-degree of a node does not affect its pagerank (first order markov property). The part of graph which is updated (edge additions / edge deletions / weight changes) is used to find the affected partition of graph using BFS. The unaffected partition is simply scaled, and pagerank computation is done only for the affected partition.