Before revision: Multiple random walksare the movement of several independent random walkers on a graph , and are applied to various graph algorithms. In order to design an efficient graph algorithm based on multiple random walks , it is essential to study multiple random walks theoretically for deeply understanding their characteristics.
After revision: Multiple random walksare the movement of several independent random walkers on a graph . Designing an efficient graph algorithm based on multiple random walks , it is essential to study multiple random walks theoretically for deeply understanding their characteristics.