Higham, Desmond J. and Taylor, Alan (2003) The sleekest link algorithm. Mathematics Today, 39. pp. 192197. ISSN 13612042

PDF (strathprints000165.pdf)
strathprints000165.pdf Download (180kB)  Preview 
Abstract
How does Google decide which web sites are important? It uses an ingenious algorithm that exploits the structure of the web and is resistant to hacking. Here, we describe this PageRank algorithm, illustrate it by example, and show how it can be interpreted as a Jacobi iteration and a teleporting random walk. We also ask the algorithm to rank the undergraduate mathematics classes offered at the University of Strathclyde. PageRank draws upon ideas from linear algebra, graph theory and stochastic processes, and it throws up researchlevel challenges in scientific computing. It thus forms an exciting and modern application area that could brighten up many a mathematics class syllabus.
Item type:  Article 

ID code:  165 
Keywords:  google, search algorithms, pagerank, jacobi iteration, numerical mathematics, Mathematics 
Subjects:  Science > Mathematics 
Department:  Faculty of Science > Mathematics and Statistics 
Depositing user:  Ms Sarah Scott 
Date Deposited:  14 Mar 2006 
Last modified:  26 Mar 2015 15:47 
URI:  http://strathprints.strath.ac.uk/id/eprint/165 
Actions (login required)
View Item 