# Implement Random Walk with Restarts

## Details

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Affects Version/s: 0.5
• Fix Version/s:
• Component/s: None
• Labels:
None

## Description

I'll create an implementation of Random Walk with Restarts as described in Kang, Tsourakakis, Faloutsos, "PEGASUS: A Peta-Scale Graph Mining System - Implementation and Observations" http://www.cs.cmu.edu/~christos/PUBLICATIONS/icdm09-pegasus.pdf

The algorithm is a random walk similar to PageRank with the difference that you start at and teleport to a certain node. The probabilities it computes can be seen as a measure of proximity between the start node and a reached node. To my knowledge RWR can be e.g used for link predicition in social networks.

I will try to create an implementation that is able to do several walks in parallel and I will assume that a steadystate probability vector fits in memory.

I don't plan to use the implementation details from the paper but I'll model the algorithm as an iterative multiplication between the adjacency matrix of the graph and the matrix created from the steadystate probability vectors for the vertices we compute the random walks for.

## Activity

 Component/s Graph [ 12314508 ]
 Status Resolved [ 5 ] Closed [ 6 ]
 Status Open [ 1 ] Resolved [ 5 ] Resolution Fixed [ 1 ]
 Fix Version/s 0.6 [ 12316364 ] Affects Version/s 0.5 [ 12315255 ] Affects Version/s 0.6 [ 12316364 ]
Field Original Value New Value
Description I'll create an implementation of Random Walk with Restarts as described in Kang, Tsourakakis, Faloutsos, "PEGASUS: A Peta-Scale Graph Mining System - Implementation and Observations" http://www.cs.cmu.edu/~christos/PUBLICATIONS/icdm09-pegasus.pdf

The algorithm is a random walk similar to PageRank with the difference that you start at and teleport to a certain node. The probabilities it computes can be seen as a measure of proximity between the start node and a reached node. To my knowledge RWR can be e.g used for link predicition in social networks.

I will try to create an implementation that is able to do several walks in parallel and I will assume that a steadystate probability vector fits in memory.
I'll create an implementation of Random Walk with Restarts as described in Kang, Tsourakakis, Faloutsos, "PEGASUS: A Peta-Scale Graph Mining System - Implementation and Observations" http://www.cs.cmu.edu/~christos/PUBLICATIONS/icdm09-pegasus.pdf

The algorithm is a random walk similar to PageRank with the difference that you start at and teleport to a certain node. The probabilities it computes can be seen as a measure of proximity between the start node and a reached node. To my knowledge RWR can be e.g used for link predicition in social networks.

I will try to create an implementation that is able to do several walks in parallel and I will assume that a steadystate probability vector fits in memory.

I don't plan to use the implementation details from the paper but I'll model the algorithm as an iterative multiplication between the adjacency matrix of the graph and the matrix created from the steadystate probability vectors for the vertices we compute the random walks for.
Sebastian Schelter created issue -

## People

• Assignee:
Sebastian Schelter
Reporter:
Sebastian Schelter