Steering the Random Surfer on Directed Webgraphs

2016 ◽  
Author(s):  
Florian Geigl ◽  
Simon Walk ◽  
Markus Strohmaier ◽  
Denis Helic
Keyword(s):  
Random Surfer

scholarly journals Kemeny's Constant and the Random Surfer

2002 ◽  
Vol 109 (8) ◽  
pp. 741 ◽  
Author(s):  
Mark Levene ◽  
George Loizou
Keyword(s):  
Random Surfer

scholarly journals IMPLEMENTATION OF PAGERANK ALGORITHM IN MATLAB

2017 ◽  
Vol 1 (1) ◽  
Author(s):  
Rima Aprilia ◽  
Rina Filia Sari
Keyword(s):  
Decisive Factor ◽  
Pagerank Algorithm ◽  
Random Surfer

Implementation of the PageRank algorithm to rank web generally only contain static and dynamic pages, with the rapid url users then needed an algorithm for calculating web rankings. In determining the ranking of a web, links incoming and outgoing links are also random surfer model is one decisive factor in determining the ranking of a web. Implementation of PageRank on MATLAB formed on a program in the m-file.

Detecting Webspam Beneficiaries Using Information Collected by the Random Surfer

2011 ◽  
Vol 2 (2) ◽  
pp. 36-48
Author(s):  
Thomas Largillier ◽  
Sylvain Peyronnet
Keyword(s):  
Random Walks ◽  
Search Engine ◽  
Search Engines ◽  
Random Surfer

Search engines use several criteria to rank webpages and choose which pages to display when answering a request. Those criteria can be separated into two notions, relevance and popularity. The notion of popularity is calculated by the search engine and is related to links made to the webpage. Malicious webmasters want to artificially increase their popularity; the techniques they use are often referred to as Webspam. It can take many forms and is in constant evolution, but Webspam usually consists of building a specific dedicated structure of spam pages around a given target page. It is important for a search engine to address the issue of Webspam; otherwise, it cannot provide users with fair and reliable results. In this paper, the authors propose a technique to identify Webspam through the frequency language associated with random walks among those dedicated structures. The authors identify the language by calculating the frequency of appearance of k-grams on random walks launched from every node.

scholarly journals Kemeny's Constant and the Random Surfer

2002 ◽  
Vol 109 (8) ◽  
pp. 741-745 ◽  
Author(s):  
Mark Levene ◽  
George Loizou
Keyword(s):  
Random Surfer

scholarly journals Optimal Prefetching in Random Trees

Mathematics ◽  
2021 ◽  
Vol 9 (19) ◽  
pp. 2437
Author(s):  
Kausthub Keshava ◽  
Alain Jean-Marie ◽  
Sara Alouf
Keyword(s):  
Markov Decision Process ◽  
Optimal Policy ◽  
Decision Process ◽  
Random Trees ◽  
Random Tree ◽  
Process Theory ◽  
Markov Decision ◽  
Random Surfer

We propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively. A random surfer moves along the edges of a random tree representing possible sequences of documents, which is known to a controller only up to depth d. A quantity k of documents can be prefetched between two movements. The question is to determine which nodes of the known tree should be prefetched so as to minimize the probability of the surfer moving to a node not prefetched. We analyzed the model with the tools of Markov decision process theory. We formally identified the optimal policy in several situations, and we identified it numerically in others.

Sign in / Sign up

Export Citation Format

Share Document