Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Fabien Mathieu Connect in order to contact the contributor
Submitted on : Thursday, February 9, 2012 - 4:12:47 PM
Last modification on : Tuesday, September 6, 2022 - 4:53:53 PM
Long-term archiving on: : Thursday, May 10, 2012 - 2:50:25 AM


Publisher files allowed on an open archive




Fabien Mathieu, Mohamed Bouklit. The effect of the back button in a random walk: application for pagerank. WWW '04 - Special interest tracks and posters of the 13th international conference on World Wide Web, May 2004, New York, United States. pp.370-371, ⟨10.1145/1013367.1013480⟩. ⟨hal-00668339⟩



Record views


Files downloads