Ranking pages and the topology of the web Argimiro Arratia∗ Departament de Llenguatges i Sistemes Inform`atics, Universitat Polit`ecnica de Catalunya, Barcelona, Spain
[email protected] Carlos Mariju´an † Departamento de Matem´atica Aplicada Universidad de Valladolid, Valladolid, Spain,
[email protected] Abstract This paper presents our studies on the rearrangement of links in the structure of websites for the purpose of improving the valuation of a page or group of pages as established by a ranking function as Google’s PageRank. We build our topo- logical taxonomy starting from unidirectional and bidirectional rooted trees, and up to more complex hierarchical structures as cyclical rooted trees (obtained by closing cycles on bidirectional trees) and PR–digraph rooted trees (digraphs whose condensation digraph is a rooted tree that behave like cyclical rooted trees). We give different modifications on the structure of these trees and its effect on the valuation given by the PageRank function. We derive closed formulas for the PageRank of the root of various types of trees, and establish a hierarchy of these topologies in terms of PageRank. Keywords: PageRank, world wide web topology, link structure. AMS Math. Subject Classification: 05C05, 05C99, 05C40, 68R10, 94C15. 1 Introduction arXiv:1105.1595v2 [cs.DM] 23 Apr 2012 Google is still today’s most popular search engine for the World Wide Web, and the key to its success has been its PageRank algorithm [4], which ranks documents based primarily on the link structure of the web. Simply put, PageRank considers a link from a page H to another page J as a weighted vote from H in favour of the importance of J, where the weight of the vote of H is itself determined by the number of links (or voters) to H.