The effect of the back button in a random walk: application for pagerank
Abstract
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by Page, Brin et al., is used by the Google search engine 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.
Origin : Publisher files allowed on an open archive
Loading...