Fiddling With PageRank
This paper deals with the various changes that can be made to the basic PageRank model. We
document the recent findings and add a few new contributions. These contributions concern (1) the
sensitivity of the PageRank vector, (2) another method of forcing the Markov chain to be irreducible,
and (3) a proof of the full spectrum of the PageRank matrix.
- CRSC Tech Report crsc-tr03-34
- Amy N. Langville
- Carl D. Meyer
- THE POSTSCRIPT FILE
- The postscript file (uncompressed) for the entire paper is 1.5MB.
- To receive it, click on
- THE PDF FILE
- The pdf file for the entire paper is 140KB.
- To receive the PDF file, click on
Return To Meyer's Home Page
Return To Abstracts