A Novel Method for Dynamic Community Discovery

Traditional Community discovery focuses on the study of statical structures of social network while ignores the individuals with high motility. This paper in terms of the dynamic discovery problems in social network, on the basis of complex priority and the grouth theorem, comes up with a new method that according to the degree distribution of vertices to dynamically simulate the formation of the whole network. Using Zachary and Les miserables as our test-bed to verify the results of our algorithm, we proved that this method is able to find the communities with great accuracy and efficiency.