Before revision:  In order to design an efficient graph algorithm using multiple random walks, it is essential to study theoretical considerations for deeply understanding the characteristicsof graph algorithms .
After revision:  In order to design an efficient graph algorithm based on multiple random walks, it is essential to study theoretical considerations for deeply understanding the characteristicsof graph algorithms .