Link Analysis, Eigenvectors and Stability

The HITS and the PageRank algorithms are eigenvector methods for identifying "authoritative" or "influential" articles, given hyperlink or citation information. That such algorithms should give consistent answers is surely a desideratum, and in this paper, we address the question of when they can be expected to give stable rankings under small perturbations to the hyperlink patterns. Using tools from matrix perturbation theory and Markov chain theory, we provide conditions under which these methods are stable, and give specific examples of instability when these conditions are violated. We also briefly describe a modification to HITS that improves its stability.

• Type: Conference
• Year: 2001
• Where: IJCAI
• Authors: Andrew Y. Ng, Alice X. Zheng, Michael I. Jordan
• Keywords: Eigenvector Methods, IJCAI 2001, IJCAI 2007, Markov Chain Theory, Matrix Perturbation Theory