Authors: Peserico, E; Pretto, L; Dip Ing Informaz; Dip Ing Informaz; This 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. © 2009 Springer Berlin Heidelberg. Peserico; Pretto

Journal: English

Conference: 15th Annual International Conference on Computing and Combinatorics (COCOON)

Publisher: Springer-Verlag

Published: doi

DOI: WOS:000269148100035

Issue: 5609, Pages: 357-HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank