This is a link analysis algorithm for directed networks. Though original= ly designed to rank pages on the World Wide Web, it can also be applied to = graphs such as citation networks.

=20The *damping factor* is the probability that a random crawler of =
the network will continue to follow links.

PageRank is calculated with the power method, that is, by multiplying th= e transition matrix of the PageRank process by an initial arbitrary vector = and repeating the multiplication until product stabilizes. The components o= f this stationary vector are the PageRank values of the nodes of the networ= k.

=20The algorithm runs in `O(E)`

time where `E`

is the=
number of edges of the network.

- =20
- Source Code =20

The algorithm was implemented, integrated, and documented by Russell Duh= on with additional documentation from Joseph Biberstine.

=20Brin, S., Page, L. (2001) The Anatomy of a =
Large-Scale Hypertextual Web Search Engine.

Proceedings of the seve=
nth International Conference on the World Wide Web (WWW1998):107-117.

The license could not be verified: License Certificate has expired!=20
Generate a Free license now.