Affiliation:
1. Technical University Ilmenau, Ilmenau, Germany
Abstract
PageRank, one part of the search engine Google, is one of the most prominent link-based rankings of documents in the World Wide Web. Usually it is described as a Markov chain modeling a specific random surfer. In this article, an alternative representation as a power series is given. Nonetheless, it is possible to interpret the values as probabilities in a random surfer setting, differing from the usual one.Using the new description we restate and extend some results concerning the convergence of the standard iteration used for PageRank. Furthermore we take a closer look at sinks and sources, leading to some suggestions for faster implementations.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference16 articles.
1. Inside PageRank
2. Brin S. Page L. Motwani R. and Winograd T. 1999. The PageRank citation ranking: Bringing order to the Web. Tech. rep. 1999-66 Stanford Digital Library Technologies Project. http://dbpubs.stanford.edu:8090/pub/1999-66. Brin S. Page L. Motwani R. and Winograd T. 1999. The PageRank citation ranking: Bringing order to the Web. Tech. rep. 1999-66 Stanford Digital Library Technologies Project. http://dbpubs.stanford.edu:8090/pub/1999-66.
3. Lecture Notes in Computer Science;Brinkmeier M.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献