Fast Incremental and Personalized PageRank

In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus on SALSA), on large-scale dynamically evolving social networks. We assume that the graph of friendships is stored in distributed shared memory, as is the case for large social networks such as Twitter. For global PageRank, we assume that the social network has n nodes, and m adversarially chosen edges arrive in a random order. We show that with a reset probability of , the expected total work needed to maintain an accurate estimate (using the Monte Carlo method) of the PageRank of every node at all times is O(n ln m 2 ). This is significantly better than all known bounds for incremental PageRank. For instance, if we naively recompute the PageRanks as each edge arrives, the simple power iteration method needs ( m2 ln(1/(1-)) ) total time and the Monte Carlo method needs O(mn/) total time; both are prohibitively...

• Type: Journal
• Year: 2010
• Where: PVLDB
• Authors: Bahman Bahmani, Abdur Chowdhury, Ashish Goel
• Keywords: Monte Carlo, PageRank, PVLDB 2010, Social Network