The sleekest link algorithm

Desmond J. Higham, Alan Taylor

Research output: Contribution to journalArticle

26 Downloads (Pure)

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 research-level challenges in scientific computing. It thus forms an exciting and modern application area that could brighten up many a mathematics class syllabus.
Original languageEnglish
Pages (from-to)192-197
Number of pages5
JournalMathematics Today
Volume39
Publication statusPublished - 28 Aug 2003

Keywords

  • google
  • search algorithms
  • pagerank
  • jacobi iteration
  • numerical mathematics

Fingerprint Dive into the research topics of 'The sleekest link algorithm'. Together they form a unique fingerprint.

  • Cite this

    Higham, D. J., & Taylor, A. (2003). The sleekest link algorithm. Mathematics Today, 39, 192-197.