Click to select. Drag to move. Right-click to delete.
How PageRank Works
PageRank, developed by Larry Page and Sergey Brin at Stanford, ranks web pages by the structure of incoming links. A page is important if important pages link to it.
PR(i) = (1 - d) / N + d × Σ PR(j) / L(j)
- dDamping factor (default 0.85) — probability of following a link vs. jumping randomly.
- NTotal number of pages (nodes) in the graph.
- L(j)Number of outgoing links from page j.
The algorithm iterates until scores converge (change less than 0.0001 per iteration). Node size in the visualization reflects each page's current rank.
Example Graphs
Controls
500ms
FastSlow
0.85
Rankings
Iteration
0
Max Δ
0.000000
Add nodes to see rankings.