Our ¡ -step random walk approach is similar to the one proposed by Harel and Koren (2001).
their algorithm is proposed for "spatial data" where the nodes of the graph are connected by undirected links that are determined by a (symmetric) similarity function.