Community structure detecting algorithm for dynamic networks based on modularity

In order to detect the community structure in the dynamic network with node adding, a corresponding algorithm named CDD is explored. Based on the modularity changing along with the new node adding, CDD can not only detect the community structure, but also exhibit the evolution of these communities during the network structure changing. Compared with Newman's corresponding algorithms, the results of community detection for some networks, such as computer-generated networks, Ucinet networks and Pajek networks, indicate that CDD reduces running time significantly and achieves approximate modularity.