Finding Community Structure Based on Subgraph Similarity

摘要: Community identification is a long-standing challenge in the modern network science, especially for very large scale networks containing millions of nodes. In this paper, we propose new metric to quantify structural similarity between subgraphs, based on which an algorithm community designed. Extensive empirical results several real from disparate fields has demonstrated that present can provide same level reliability, measure by modularity, while takes much shorter time than well-known fast proposed Clauset, Newman and Moore (CNM). We further hybrid simultaneously enhance modularity save computational compared with CNM algorithm.