The effect of the back button in a random walk: application for pagerank

Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] to improve the results of the queries. The purpose of this article is to describe an enhanced version of the algorithm using a realistic model for the back button. We introduce a limited history stack model (you cannot click more than m times in a row), and show that when m = 1, the computation of this Back PageRank can be as fast as that of a standard PageRank. Categories and Subject Descriptors F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems--Computations on matrices General Terms Algorithms, Measurement Keywords Web analysis, PageRank, Random walk, flow, back button

• Type: Conference
• Year: 2004
• Where: WWW
• Authors: Fabien Mathieu, Mohamed Bouklit
• Keywords: Back PageRank, Internet Technology, PageRank Algorithm, Standard Pagerank, WWW 2004