19 May 2004 2 comments Mathematics
Some time ago I wrote about the Google PageRank algorithm in Python . It's a matrix algorithm for calculating the PageRank values for every page in a web. All you have to do is define which pages links to which and the algorithm calculates the PageRanks for every page for you.
Now I'm going to try to illustrate it in practise for those of you who don't know what to do with a "Python script"n:/plog/blogitem-040321-1/PageRank.py.
The purpose of this simple script is to convert the web matrix that you entered into a directed graph showing the approximated PageRank value for every node.
What you can do with this is to test how the PageRank algorithm works graphically. You might want to know what the effect is to be linked to by one very popular page or the effect of being linked by several not so popular pages. It's up to you to draw your own conclusions.
The input is limited in size (to save my poor computer) and the graphs aren't beautiful. (Thanks Ero Carrera for pydot which made this possible)