HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank
Enoch Peserico, Luca Pretto · SIAM Journal on Discrete Mathematics · 2012
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.