document: TotalRank : ranking without damping PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor α that spreads part of the rank . The choice of α is eminently empirical , but most applications use α = 0.85 ; nonetheless , the selection of α is critical , and some believe that link farms may use this choice adversarially . Recent results ( 1 ) prove that the PageRank of a page is a rational function of α , and that this function can be approximated quite efficiently : this fact can be used to define a new form of ranking , TotalRank , that averages PageRanks over all possible α 's . We show how this rank can be computed efficiently , and provide some preliminary experimental results on its quality and comparisons with PageRank .
doc_bio_tags: O O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O