Google’s PageRank Explained or Why you should’ve paid attention in Math 319
Posted: December 6th, 2006 | Author: Mark Anderson | Filed under: Strategy | Tags: Google, page rank, SEO | 2 Comments »
Okay, I’m still reading How Google Finds Your Needle in the Web’s Haystack, but this much is clear:
PageRank is complicated.
My motivation for posting this is entirely selfish. Next time someone asks “can you tell Google to put my page at the top?” I can reply “that all depends on your eigenvalues, here’s a link.”
I don’t know about you, but in my experience, using the word eigenvalue usually puts an end to any conversation. 
You’re reading the eigenvalue bit ? I read about that and I don’t get it.
Try Ian Rogers website,
http://www.ianrogers.net/google-page-rank/
he has an iteration model that’s far closer to actual reality.
If you program that in a site-class object model you are almost 1:1 with the actual rank distribution in a website.
Then, apart from math models, there is the web’s reality where all model’s fail
Cheers.
I’ll give that a closer read. It’s been so long since I’ve done Linear Algebra or differential equations that I’ve got little hope of really understanding the full depth of this explanation.
And thanks for a legitimate comment (they’re few and far between for me).