Detecting communities in large networks using the extended Walktrap algorithm

In this paper, we extended the Walk trap algorithm [16], which improve consisting of vertices connecting First, we propose an extended lazy random walk (ELRW), and then we use this walk to define the distance between vertices on a graph similar to the Walktrap algorithm. When applying this algorithm, if we choose the coefficient of a reasonably extended lazy random walk, we will get better clustering results when using the Walk trap algorithm. Finally, we also program to demonstrate the efficiency of this algorithm.