pagerank
Mathematical Programming with Python
https://people.sc.fsu.edu/~jburkardt/classes/...
python_2025/pagerank/pagerank.html
pagerank:
The Page Rank algorithm, a method of assigning importance
to every node in a graph; this is the basis of the Google
search algorithm; it is also an example of the power method
for an enormous matrix; to get the power method to work on
an enormous network, the algorithm's inventors had to
patch the original method, and add a randomization feature,
in order to get good results quickly. This is a fundamental
algorithm of machine learning.
Lecture notes:
-
google_rank.py,
given vector x and Google matrix G, return G*x.
Call x = google_rank ( x, G ) repeatedly to get Google ranking.
-
adjacency_to_google.py,
given adjacency matrix A, return Google matrix G.
-
adjacency_to_transition.py,
given adjacency matrix A, return transition matrix T.
-
pagerank.py
-
power_rank.py,
given vector x and transition matrix T, return T*x.
Call x = power_rank(x,T) repeatedly to do power ranking.
-
surf_rank.py,
given vector x and the adjacency matrix A,
pick a random starting point, take a number of steps around
the graph, and rank the sites by how often you visited each one.
Last revised on 12 February 2025.