HITS can converge slowly, but not too slowly, in score and rank

none2This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in rank (i.e. to ``get right'' the order of the nodes). We prove upper and almost matching lower bounds. We also extend our results to weighted graphs.noneE. PESERICO; L. PRETTOPESERICO STECCHINI NEGRI DE SALVI, Enoch; Pretto, Luc

Hits can converge slowly, but not too slowly, in score and rank

This article explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in rank (i.e. to "get right" the order of the nodes). We prove upper and almost matching lower bounds. We also extend our results to weighted graphs