53
Views
3
CrossRef citations to date
0
Altmetric
Articles

An Aitken-extrapolated Gauss-Seidel method for computing PageRank

, , &

References

  • P. Berkhin, “A survey on pagerank computing,” Internet Math., vol. 2, no. 1, pp. 73–120, 2005. doi: 10.1080/15427951.2005.10129098
  • L. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank citation ranking: Bringing order to the web.,” 1999.
  • A. Cicone and S. Serra-Capizzano, “Google PageRanking problem: The model and the analysis,” J. Comput. Appl. Math., vol. 234, no. 11, pp. 3140–3169, 2010. doi: 10.1016/j.cam.2010.02.005
  • H.-H. Fu and J. C.-T. Wu, “Quality of search engines: how good is Google pagerank?,” J. Inf. Optim. Sci., vol. 31, no. 2, pp. 455–468, 2010.
  • Srivastava, Atul Kumar, Rakhi Garg, and P. K. Mishra. “Analysis of iterative methods in PageRank computation.” Journal of Information and Optimization Sciences 39.1 (2018): 129-142. doi: 10.1080/02522667.2017.1372914
  • S. Brin and L. Page, “Reprint of: The anatomy of a large-scale hypertextual web search engine,” Comput. networks, vol. 56, no. 18, pp. 3825–3833, 2012. doi: 10.1016/j.comnet.2012.10.007
  • Y. Zhu, S. Ye, and X. Li, “Distributed PageRank computation based on iterative aggregation-disaggregation methods,” in Proceedings of the 14th ACM international conference on Information and knowledge management, 2005, pp. 578–585.
  • A. N. Langville and C. D. Meyer, “Deeper inside pagerank,” Internet Math., vol. 1, no. 3, pp. 335–380, 2004. doi: 10.1080/15427951.2004.10129091
  • M. Brinkmeier, “PageRank revisited,” ACM Trans. Internet Technol., vol. 6, no. 3, pp. 282–301, 2006. doi: 10.1145/1151087.1151090
  • M. Bianchini, M. Gori, and F. Scarselli, “Inside pagerank,” ACM Trans. Internet Technol., vol. 5, no. 1, pp. 92–128, 2005. doi: 10.1145/1052934.1052938
  • N. Eiron, K. S. McCurley, and J. A. Tomlin, “Ranking the web frontier,” in Proceedings of the 13th international conference on World Wide Web, 2004, pp. 309–318.
  • R. S. Varga, Matrix iterative analysis, vol. 27. Springer Science & Business Media, 2009.
  • C. D. Meyer, Matrix analysis and applied linear algebra, vol. 2. Siam, 2000.
  • H. Sun and Y. Wei, “A note on the PageRank algorithm,” Appl. Math. Comput., vol. 179, no. 2, pp. 799–806, 2006.
  • P. Boldi, M. Santini, and S. Vigna, “PageRank as a function of the damping factor,” in Proceedings of the 14th international conference on World Wide Web, 2005, pp. 557–566.
  • S. Serra-Capizzano, “Jordan canonical form of the Google matrix: a potential contribution to the PageRank computation,” SIAM J. Matrix Anal. Appl., vol. 27, no. 2, pp. 305–312, 2005. doi: 10.1137/S0895479804441407
  • K. Avrachenkov, N. Litvak, and K. S. Pham, “A singular perturbation approach for choosing the PageRank damping factor,” Internet Math., vol. 5, no. 1–2, pp. 47–69, 2008. doi: 10.1080/15427951.2008.10129300
  • G. M. Del Corso, A. Gull\’\i, and F. Romani, “Comparison of Krylov subspace methods on the PageRank problem,” J. Comput. Appl. Math., vol. 210, no. 1, pp. 159–166, 2007. doi: 10.1016/j.cam.2006.10.080
  • A. Bourchtein and L. Bourchtein, “On some analytical properties of a general PageRank algorithm,” Math. Comput. Model., vol. 57, no. 9–10, pp. 2248–2256, May 2013. doi: 10.1016/j.mcm.2011.06.033
  • C. Brezinski and M. Redivo-Zaglia, “Rational extrapolation for the PageRank vector,” Math. Comput., vol. 77, no. 263, pp. 1585–1598, 2008. doi: 10.1090/S0025-5718-08-02086-3
  • A. N. Langville and C. D. Meyer, “A reordering for the PageRank problem,” SIAM J. Sci. Comput., vol. 27, no. 6, pp. 2112–2120, 2006. doi: 10.1137/040607551
  • C. Brezinski, M. Redivo-Zaglia, and S. Serra-Capizzano, “Extrapolation methods for PageRank computations,” Comptes Rendus Math., vol. 340, no. 5, pp. 393–397, 2005. doi: 10.1016/j.crma.2005.01.015
  • S. Kamvar, T. Haveliwala, C. Manning, and G. Golub, “Exploiting the block structure of the web for computing pagerank,” 2003.
  • G. Wu and Y. Wei, “An Arnoldi-extrapolation algorithm for computing PageRank,” J. Comput. Appl. Math., vol. 234, no. 11, pp. 3196–3212, 2010. doi: 10.1016/j.cam.2010.02.009
  • A. N. Langville and C. D. Meyer, Google’s PageRank and beyond: The science of search engine rankings. Princeton University Press, 2011.
  • C. H. Bischof, “Adaptive blocking in the QR factorization,” J. Super-comput., vol. 3, no. 3, pp. 193–208, 1989. doi: 10.1007/BF00127828
  • A. Arasu, J. Novak, A. Tomkins, and J. Tomlin, “PageRank computation and the structure of the web: Experiments and algorithms,” in Proceedings of the Eleventh International World Wide Web Conference, Poster Track, 2002, pp. 107–117.
  • S. Kamvar, T. Haveliwala, and G. Golub, “Adaptive methods for the computation of PageRank,” Linear Algebra Appl., vol. 386, pp. 51–65, 2004. doi: 10.1016/j.laa.2003.12.008
  • X. Tan, “A new extrapolation method for PageRank computations,” J. Comput. Appl. Math., vol. 313, pp. 383–392, 2017. doi: 10.1016/j.cam.2016.08.034
  • Gu, C., & Wang, W., An Arnoldi-Inout algorithm for computing Pag-eRank problems. Journal of Computational and Applied Mathematics, vol. 309, pp. 219–229, 2017.. doi: 10.1016/j.cam.2016.05.026
  • W. J. Stewart, Introduction to the numerical solutions of Markov chains. Princeton Univ. Press, 1994.
  • G. M. Del Corso, A. Gulli, and F. Romani, “Fast PageRank computation via a sparse linear system,” Internet Math., vol. 2, no. 3, pp. 251–273, 2005. doi: 10.1080/15427951.2005.10129108
  • C. Moler, “The world’s largest matrix computation.” 2002.
  • A. T. Tiruneh, “Higher order aitken extrapolation with application to converging and diverging Gauss-Seidel iterations,” arXiv Prepr. arXiv1310.4288, 2013.
  • J. Leskovec and A. Krevl, “{SNAP Datasets}: {Stanford} Large Network Dataset Collection.” Jun-2014.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.