Google’s pagerank
✍ Scribed by Rebecca S. Wills
- Book ID
- 105676362
- Publisher
- Springer-Verlag
- Year
- 2006
- Tongue
- English
- Weight
- 633 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0343-6993
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
a b s t r a c t Computing Google's PageRank via lumping the Google matrix was recently analyzed in [I.C.F. Ipsen, T.M. Selee, PageRank computation, with special attention to dangling nodes, SIAM J. Matrix Anal. Appl. 29 (2007Appl. 29 ( ) 1281Appl. 29 ( -1296]]. It was shown that all of the dangling
The spectral and Jordan structures of the Web hyperlink matrix G(c) = cG+(1-c)ev T have been analyzed when G is the basic (stochastic) Google matrix, c is a real parameter such that 0 < c < 1, v is a nonnegative probability vector, and e is the all-ones vector. Typical studies have relied heavily on