On the mathematical background of Google PageRank algorithm
Alberto Peretti and
Alberto Roveda ()
No 25/2014, Working Papers from University of Verona, Department of Economics
The PageRank algorithm, the kernel of the method used by Google Search to give us the answer of a search we are asking in the web, contains a lot of mathematics. Maybe one could say that graphs and Markov chains theories are in the background, while the crucial steps are in a linear algebra context, as the eigenvalues of a matrix are involved. In this working paper we deal with all the mathematics we need to explain how the PageRank method works.
Keywords: Graph theory; Linear mappings; Eigenvalues; Markov chains. (search for similar items in EconPapers)
JEL-codes: C65 (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (3) Track citations by RSS feed
Downloads: (external link)
http://dse.univr.it/home/workingpapers/wp2014n25.pdf First version (application/pdf)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ver:wpaper:25/2014
Access Statistics for this paper
More papers in Working Papers from University of Verona, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Michael Reiter ().