On computing PageRank via lumping the Google matrix
Journal of Computational and Applied Mathematics
Google PageRanking problem: The model and the analysis
Journal of Computational and Applied Mathematics
An Arnoldi-Extrapolation algorithm for computing PageRank
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
The Google matrix is a Web hyperlink matrix which is given by $P(\alpha)=\alpha P+(1-\alpha)E$, where $P$ is a row stochastic matrix, $E$ is a row stochastic rank-one matrix, and $0SIAM J. Matrix Anal. Appl., 27 (2005), pp. 305-312]) can be used for estimating the condition number of the PageRank vector as a function of $\alpha$ now viewed in the complex field. Furthermore, we give insight into a more efficient scaling matrix in order to minimize the condition number.