Fig. 1From: Limited random walk algorithm for big graph data clusteringSimulated graphs. a \(q=4\), b \(q=1.22\). The clusters are colored differently and the graphs are visualized by a force-directed methodBack to article page