Sciweavers

COCOON
2009
Springer

HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank

14 years 5 months ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
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.
Enoch Peserico, Luca Pretto
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where COCOON
Authors Enoch Peserico, Luca Pretto
Comments (0)