Abstract:

Community detection has been a hot topic in complex network research. Fast and accurate community detection can provide a good foundation for studying the properties of complex networks. Traditional community detection methods are mainly based on the global community. However, as the number of nodes in the network increases, the network size becomes larger, so the community detection becomes more complex. We propose a local community detection method, which does not need to know the whole complex network information. Rather it just starts from an initial node and calculates the tightness between the initial node and the adjacent nodes. Adjacent nodes are gradually added to the community, and finally the community structure of the initial node is obtained. Meanwhile, this method can detect the global network community. We apply the proposed method to the Zachary karate club network and dolphin social network, and experimental results demonstrate its accuracy and feasibility.       

Key words: local community;community detection;clustering coefficient