Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

The sleekest link algorithm

Higham, Desmond J. and Taylor, Alan (2003) The sleekest link algorithm. Mathematics Today, 39. pp. 192-197. ISSN 1361-2042

[img]
Preview
PDF (strathprints000165.pdf)
Download (176Kb) | 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 research-level 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
    Related URLs:
    Depositing user: Ms Sarah Scott
    Date Deposited: 14 Mar 2006
    Last modified: 17 Jul 2013 03:43
    URI: http://strathprints.strath.ac.uk/id/eprint/165

    Actions (login required)

    View Item

    Fulltext Downloads: