i think this would be a very interesting read... unfortunately my math skills are not at the Princeton U. level, but maybe it would give me incentive to hone my skills... yeah right.
Ha, ive got an exam on monday called "digital libraries", one of the parts of that is the same sort of thing, although we need to know page rank in terms of graphs and nodes etc... I hate it so much, although i have to say it is one of the maths topics that has some real life uses
Brin+Page published the formula in a paper they wrote a couple of years ago. It's public domain but it's fairly indecipherable by anyone without a maths PhD.
You don't need a PhD in math to understand Brin & Page's paper. There only seems to be about one equation and it's an easy one. Their paper can be found here: http://www-db.stanford.edu/pub/papers/google.pdf It is very out-of-date, since it's from the very start of Google. It's a good introduction to the fundamental idea of PageRank, but it's certainly not a useful reference for the way Google weights subtle page elements and handles optimization now. No book is going to contain those trade secrets. Here's an interesting quote that shows how old the paper is: