PageRank algorithm

From Glitchdata
Revision as of 04:12, 30 April 2019 by Terence (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

PageRank is an algorithm that measures the transitive influence or connectivity of nodes.

It can be computed by either iteratively distributing one node’s rank (originally based on degree) over its neighbours or by randomly traversing the graph and counting the frequency of hitting each node during these walks.