The sleekest link algorithm

Desmond J. Higham, Alan Taylor

Research output: Contribution to journalArticle

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.
LanguageEnglish
Pages192-197
Number of pages5
JournalMathematics Today
Volume39
Publication statusPublished - 28 Aug 2003

Fingerprint

PageRank
Scientific Computing
Graph theory
Linear algebra
Jacobi
Stochastic Processes
Random walk
Iteration
Class

Keywords

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

Cite this

Higham, D. J., & Taylor, A. (2003). The sleekest link algorithm. Mathematics Today, 39, 192-197.
Higham, Desmond J. ; Taylor, Alan. / The sleekest link algorithm. In: Mathematics Today. 2003 ; Vol. 39. pp. 192-197.
@article{4642164a1e4940b0ad805ba43a1a242e,
title = "The sleekest link algorithm",
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.",
keywords = "google, search algorithms, pagerank, jacobi iteration, numerical mathematics",
author = "Higham, {Desmond J.} and Alan Taylor",
year = "2003",
month = "8",
day = "28",
language = "English",
volume = "39",
pages = "192--197",
journal = "Mathematics Today",
issn = "1361-2042",

}

Higham, DJ & Taylor, A 2003, 'The sleekest link algorithm' Mathematics Today, vol. 39, pp. 192-197.

The sleekest link algorithm. / Higham, Desmond J.; Taylor, Alan.

In: Mathematics Today, Vol. 39, 28.08.2003, p. 192-197.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The sleekest link algorithm

AU - Higham, Desmond J.

AU - Taylor, Alan

PY - 2003/8/28

Y1 - 2003/8/28

N2 - 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.

AB - 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.

KW - google

KW - search algorithms

KW - pagerank

KW - jacobi iteration

KW - numerical mathematics

M3 - Article

VL - 39

SP - 192

EP - 197

JO - Mathematics Today

T2 - Mathematics Today

JF - Mathematics Today

SN - 1361-2042

ER -

Higham DJ, Taylor A. The sleekest link algorithm. Mathematics Today. 2003 Aug 28;39:192-197.