PageRank as a Random Walk A general framework for measuring the quality of an index and providing the background on the PageRank and Random Walks. Imagine a Web surfer who wanders the Web. At each step, he/she either jumps to a page on the Web chosen uniformly at random, or follows a link chosen from those on the current page. http://www8.org/w8-papers/2c-search-discover/measuring/measuring.html

PageRank Computation Methods A poster paper by Stanford db group which describes iterative methods for calculating PageRank. [PDF format] http://www2002.org/CDROM/poster/173.pdf

What is this Page Known for? Computing Web Page Reputations, PageRank and Hub and Authority generalization based on the topic of Web Pages. Definition of a model where a surfer can move forward (following an out-going link) and backward (following an in-going link in the inverse direction). [PS format] http://www.cs.ualberta.ca/~drafiei/papers/www9.ps

PageRank Used to Characterize Web Structure PageRank's values on the Web follow a power law. An high in-degree of a node does not imply high PageRank, and vice versa. [PDF format] http://www.cs.purdue.edu/homes/gopal/prank.pdf

Authoritative Sources in a Hyperlinked Environment HITs is a link-structure analysis algorithm which ranks pages by "authorities" (pages which have many incoming links and provide the best source of information on a given topic) and "hubs" (pages which have many outgoing links and provide useful lists of possibly relevant pages). Ranking is performed at query time. [PDF format] http://www.cs.cornell.edu/home/kleinber/auth.pdf

The Clever Project The CLEVER search engine incorporates several algorithms that make use of hyperlink structure for discovering information on the Web. It is an extension of Hits method. http://www.almaden.ibm.com/cs/k53/clever.html

SALSA: The Stochastic Approach for Link-Structure Analysis A focused search algorithm (SALSA) based on Markov chains. It starts with a query on a broad topic, discards useless links, and then weights the remaining terms. A stochastic crawl is used to discover the authorities on this topic. [PS format] http://www.cs.technion.ac.il/~moran/r/PS/lm-feb01.ps

The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank This method uses query dependent importance scores and a probabilistic approach to improve upon PageRank. It pre-computes importance scores offline for every possible text query. [PDF format] http://www.cs.washington.edu/homes/pedrod/papers/nips01b.pdf

Web Page Scoring Systems for Horizontal and Vertical Search "Random Surfer" model extension. At each step of traversal of the Web graph, the surfer can jump to a random node or follow a hyperlink or follow a back-link (a hyperlink in the inverse direction) or stay in the same node. http://www2002.org/CDROM/refereed/629/

Link Analysis, Eigenvectors, and Stability Do Hits and PageRank (and some variations) give stable rankings under small perturbations to the linkage patterns? [PS format] http://www.cs.berkeley.edu/~alicez/ijcai01-linkanalysis.ps

Improvement to Clever Algorithm A Kleimberg's algorithm improvement. [PDF format] http://www2002.org/CDROM/poster/171.pdf

PageRank: A Circuital Analysis It shows some theoretical results for understanding the distribution of the score in the Web according to PageRank. Seven golden rules for building good pages are presented. [PDF format] http://www2002.org/CDROM/poster/165.pdf

Improvement of HITS-based Algorithms on Web Documents It proposes a new weighted HITS-based method that assigns appropriate weights to in-links of root documents and combines content analysis with HITS-based algorithms. http://www2002.org/CDROM/refereed/643/

Probabilistic Combination of Content and Links It introduces a probabilistic model that integrates link topology (used to identify important pages), anchor text (used to augment the text of cited pages), and activation (spread to linked pages). Experiments are on MSN Directory. [PDF format] http://research.microsoft.com/copyright/accept.asp?path=http://research.microsoft.com/~sdumais/SIGIR2001-LinksRevisedSubmitted.pdf&pub=ACM

The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity This paper describes a joint probabilistic model for modeling the contents and inter-connectivity of document collections such as sets of web pages or research paper archives. [PDF format] http://www.cs.cmu.edu/~cohn/papers/nips00.pdf

Scaling Personalized Web Search Link Popularity algorithms biased according to a user-specified set of given interesting pages. http://dbpubs.stanford.edu:8090/pub/2002-12

Towards Exploiting Link Evolution It describes how to compute incrementally PageRank when Web graph's link topology changes. [PS format] http://www.almaden.ibm.com/cs/people/siva/papers/linkevol.ps

Web-Trec 8 and PageRank About the using of PageRank in Web Track 8 "large" and "small" datasets. [PDF format] http://trec.nist.gov/pubs/trec8/papers/acsys.pdf

Web-Trec 9 and Link Popularity About the using of Link Popularity in Web Track 9 datasets. [PDF format] http://trec.nist.gov/pubs/trec9/papers/unine9.pdf

PageRank Explained Some useful tips and tricks about Google's PageRank and other by content ranks. [PDF format] http://212.25.163.79/pagerank/documents/googlerank02.pdf