Random walk restart

[ArpitaHanjagi]

Algorithm: Random Walk with Restart (RWR)

Purpose: Computes relevance scores of nodes in a graph based on a random walker that restarts at a source node with a fixed probability.

Theory:

Represents graph as adjacency matrix.

At each step, walker either moves to a neighbor or restarts at source.

Iterates until probability vector converges.

Time Complexity: O(max_iter * V²) for adjacency matrix multiplication.

Space Complexity: O(V²) for adjacency matrix.

Input: Adjacency matrix, restart probability, source node, max iterations, tolerance.

Output: Vector of steady-state probabilities representing node relevance.

[github-actions[bot]]

This PR is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 7 days.

[github-actions[bot]]

This PR was closed because it has been stalled for 7 days with no activity.