✓ File Writeback ✕ Property Writeback ✓ Direct Return ✓ Stream Return ✕ Stats

Overview

A random walk begins at a particular node in graph and proceeds by randomly moving to one of its neighboring nodes; this process is often repeated for a defined number of steps. This concept was introduced by the British mathematician and biostatistician Karl Pearson in 1905, and it has since become a cornerstone in the study of various systems, both within and beyond graph theory.

• K. Pearson, The Problem of the Random Walk (1905)

Concepts

Random Walk

Random walk is a mathematical model employed to simulate a series of steps taken in a stochastic or unpredictable manner, like the erratic path of a drunken person.

The basic random walk is performed in a one-dimensional space: a node initiates from the origin of a number line and moves up or down by one unit at a time with equal likelihood. An example of a 10-step random walk is as follows:

Here is an example of performing this random walk multiple times, with each walk consisting of 100 steps:

Random Walk in Graph

In a graph, a random walk is a process where a path is formed by starting from a node and moving sequentially through neighboring nodes. This process is controlled by the walk depth, which determines the number of nodes to be visited.

Ultipa's Random Walk algorithm implements the classical form of random walk. By default, each edge is assigned the same weight (equal to 1), resulting in equal probabilities of traversal. When edge weights are specified, the likelihood of traversing those edges becomes proportional to their weights. It's important to note that various variations of random walk exist, such as Node2Vec Walk and Struc2Vec Walk.

Considerations

• Self-loops are also eligible to be traversed during the random walk.
• If the walk starts from an isolated node without any self-loop, the walk halts after the first step as there are no adjacent edges to proceed to.
• The Random Walk algorithm ignores the direction of edges but calculates them as undirected edges.

Syntax

• Command：algo(random_walk)
• Parameters:

Example

The example graph is as follows, numbers on edges are the values of edge property score:

File Writeback

algo(random_walk).params({
  walk_length: 6,
  walk_num: 2
}).write({
  file:{
    filename: 'walks'
}})

Results: File walks

K,
J,G,J,G,F,D,
I,I,I,H,I,I,
H,I,I,I,I,I,
G,J,G,J,G,H,
F,D,C,A,B,A,
E,F,D,C,D,C,
D,F,G,H,G,H,
C,D,F,E,F,D,
B,A,B,A,C,A,
A,C,A,C,D,F,
K,
J,G,J,G,J,G,
I,I,I,H,I,I,
H,I,H,G,J,G,
G,H,I,I,H,G,
F,D,C,D,F,E,
E,C,D,F,G,J,
D,C,D,C,E,F,
C,E,C,A,B,A,
B,A,B,A,C,A,
A,B,A,C,D,C,

Direct Return

algo(random_walk).params({
  walk_length: 6,
  walk_num: 2,
  edge_schema_property: 'score'
}) as walks
return walks

Results: walks

Stream Return

algo(random_walk).params({
  walk_length: 5,
  walk_num: 1,
  edge_schema_property: '@default.score'
}).stream() as walks
where size(walks) == 5
return walks

Results: walks