[GIRAPH-824] Concurrent Random Walks on Graphs

• Type: New Feature
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Affects Version/s: 1.1.0
• Component/s: examples
• Labels: examples graph multiple randomwalk
• Assignee: Unassigned
• Reporter: George Valkanas
• Created: 16/Jan/14 22:33
• Updated: 03/Feb/14 07:20

Description

In certain cases, running multiple random walks on the same graph may be desired (e.g., the centerpiece algorithm). The current implementation(s) for random walks on graphs are designed for a single random walk. Therefore, running multiple random walks can be done sequentially or by spawning multiple independent random walks, which can be inefficient and harder to manage within GIRAPH.

The idea is to extend the basic Random Walk examples so that the vertices are aware that they participate in multiple random walks at the same time.