Before revision:  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:  In order to design an efficient graph algorithm based on multiple random walks requires investigating multiple random walks theoretically for deeply understanding their characteristics.