Abstract
In a network, identifying all vertices whose PageRank is more than a given threshold value Δ is a basic problem that has arisen in Web and social network analyses. In this paper, we develop a nearly optimal, sublinear time, randomized algorithm for a close variant of this problem. When given a directed network G = (V,E), a threshold value Δ, and a positive constant c > 3, with probability 1 − o(1), our algorithm will return a subset S ⊆ V with the property that S contains all vertices of PageRank at least Δ and no vertex with PageRank less than Δ/c. The running time of our algorithm is always \(\tilde{O}(\frac{n}{\Delta})\). In addition, our algorithm can be efficiently implemented in various network access models including the Jump and Crawl query model recently studied by [6], making it suitable for dealing with large social and information networks.
As part of our analysis, we show that any algorithm for solving this problem must have expected time complexity of \({\Omega}(\frac{n}{\Delta})\). Thus, our algorithm is optimal up to logarithmic factors. Our algorithm (for identifying vertices with significant PageRank) applies a multi-scale sampling scheme that uses a fast personalized PageRank estimator as its main subroutine. For that, we develop a new local randomized algorithm for approximating personalized PageRank which is more robust than the earlier ones developed by Jeh and Widom [9] and by Andersen, Chung, and Lang [2].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersen, R., Borgs, C., Chayes, J.T., Hopcroft, J.E., Mirrokni, V.S., Teng, S.-H.: Local computation of pagerank contributions. Internet Mathematics 5(1), 23–45 (2008)
Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475–486 (2006)
Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte carlo methods in pagerank computation: When one iteration is sufficient. SIAM Journal on Numerical Analysis 45 (2007)
Berkhin, P.: Survey: A survey on pagerank computing. Internet Mathematics 2(1) (2005)
Berkhin, P.: Bookmark-coloring approach to personalized pagerank computing. Internet Mathematics 3(1) (2006)
Brautbar, M., Kearns, M.: Local algorithms for finding interesting individuals in large networks. In: ICS, pp. 188–199 (2010)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks 30(1-7), 107–117 (1998)
Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. Trans. Knowl. Data Eng. 15(4), 784–796 (2003)
Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271–279 (2003)
Kannan, R.: Spectral methods for matrices and tensors. In: STOC, pp. 1–12 (2010)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Stanford University (1998)
Rubinfeld, R., Shapira, A.: Sublinear time algorithms. SIAM Journal on Discrete Math. 25, 1562–1588 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgs, C., Brautbar, M., Chayes, J., Teng, SH. (2012). A Sublinear Time Algorithm for PageRank Computations. In: Bonato, A., Janssen, J. (eds) Algorithms and Models for the Web Graph. WAW 2012. Lecture Notes in Computer Science, vol 7323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30541-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-30541-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30540-5
Online ISBN: 978-3-642-30541-2
eBook Packages: Computer ScienceComputer Science (R0)