🔗 Markov Chains and PageRank
Visualize random walks and the PageRank algorithm
Network Graph
Click and drag nodes to rearrange • Click edges to reverse direction
Transition Matrix
Click "Load Preset" to see matrix
PageRank Values (Iteration 0)
Convergence History
Understanding PageRank
PageRank models web surfing as a Markov chain random walk:
- Nodes: Web pages (or any entities)
- Edges: Links between pages (transition probabilities)
- PageRank: The stationary distribution - probability of being at each page in the long run
- Damping Factor (d): Probability of following a link vs. jumping to a random page
The algorithm iterates: PR(i) = (1-d)/N + d × Σ(PR(j)/L(j)) for all pages j linking to i