no code implementations • 15 Jun 2010 • Bahman Bahmani, Abdur Chowdhury, Ashish Goel
We show that if we store $R>q\ln n$ random walks starting from every node for large enough constant $q$ (using the approach outlined for global PageRank), then the expected number of calls made to the distributed social network database is $O(k/(R^{(1-\alpha)/\alpha}))$.
