A Note on the Eigenvalues of the Google Matrix
环与代数
2025-10-20 v1 数值分析
数值分析
摘要
The Google matrix is a positive, column-stochastic matrix that is used to compute the pagerank of all the web pages on the Internet: the eigenvector corresponding to the eigenvalue 1 is the pagerank vector. Due to its huge dimension, of the order of billions, the (presently) only viable method to compute the eigenvector is the power method. For the convergence of the iteration, it is essential to know the eigenvalue distribution of the matrix. A theorem concerning the eigenvalues was recently proved by Langville and Meyer. In this note another proof is given.
引用
@article{arxiv.math/0401177,
title = {A Note on the Eigenvalues of the Google Matrix},
author = {Lars Eldén},
journal= {arXiv preprint arXiv:math/0401177},
year = {2025}
}