Numerical methods for solving the PageRank problem

• Thesis title in Czech: Numerické metody pro řešení PageRank problému
• Thesis title in English: Numerical methods for solving the PageRank problem
• Key words: PageRank problém|iterační metody|metody Krylovových podprostorů|strukturované matice
• English key words: PageRank problem|iterative methods|Krylov subspace methods|structured matrices
• Academic year of topic announcement: 2022/2023
• Thesis type: diploma thesis
• Thesis language: angličtina
• Department: Department of Numerical Mathematics (32-KNM)
• Supervisor: doc. RNDr. Petr Tichý, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 29.03.2023
• Date of assignment: 29.03.2023
• Confirmed by Study dept. on: 04.04.2023

Guidelines

The goal of the thesis is to describe numerical methods for solving the PageRank problem, to analyze their behavior and to discuss possible improvements of these methods. Numerical experiments in Matlab, comparing the considered numerical methods on relevant data, will form an important part of the thesis.

References

G. M. Del Corso, A. Gullía, F. Romani, Comparison of Krylov subspace methods on the PageRank problem, J. Comput. Appl. Math. 210, no. 1-2, 159-166, 2007.
D. F. Gleich, PageRank beyond the web. SIAM Rev. 57, no. 3, 321-363, 2015.
D. F. Gleich, A. P. Gray, C. Greif, and T. Lau, An inner-outer iteration for computing PageRank, SIAM J. Sci. Comput., 32(1):349-371, 2010.
C.Q. Gu, W.W. Wang, An Arnoldi-Inout algorithm for computing PageRank problems, J. Comput. Appl. Math. 309, 219–229, 2017.
A. N. Langville, C. D. Meyer: Google’s PageRank and beyond. The science of search engine rankings, Princeton University Press, Princeton, 2006.