Monte Carlo Based Personalized PageRank on Dynamic Networks

Monte Carlo Based Personalized PageRank on Dynamic Networks

Blog Article

In large-scale networks, the structure of the underlying network dove dark chocolate squares changes frequently, and thus the power iteration method for Personalized PageRank computation cannot deal with this kind of dynamic network efficiently.In this paper, we design a Monte Carlo-based incremental method for Personalized PageRank computation.In a dynamic network, first, we do a random walk starting from each node and save the performed walks into a fingerprint database; second, we update the fingerprint database in a fixed time interval with our proposed update algorithm; finally, when a query is issued by a user, we estimate the Personalized PageRank auto rosvin vector by our proposed approximation algorithm.

Experiments on real-world networks show that our method can handle multichanges of the underlying network at a time and is more efficient than related work, so it can be used in real incremental Personalized PageRank-based applications.