关键词: 动态挖掘，优先情节，增长定律，时间轴，强连通社区

Abstract: In terms of the dynamic community discovery problem, this article came up with the idea of basing on the priority complex and thegrouth theorem and according to the nodes degree distribution to construct the time axis to dynamically simulate the social network' s mechanism of formation and evolution, simultaneously divide the community structures. We used Zachary Club and I_es Miscrables as the experiment data to test our algorithm. Experimental results show that, the communities that the algorithm gets are all strong connected communities, it is able to dynamically, accurately discover the community structure with high practical value.

Key words: Dynamic discovery, Priority complex, Thegrouth theorem, Time axis, Strong connected communities