Discovering communities in complex networks

We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely related. Extraction of these communities facilitates better understanding of such networks. Community related research has focused on two main problems, community discovery and community identification. Community discovery is the problem of extracting all the communities in a given network whereas community identification is the problem of identifying the community to which a given set of nodes from the network belong. In this paper we first perform a brief survey of the existing communitydiscovery algorithms and then propose a novel approach to discovering communities using bibliographic metrics. We also test the proposed algorithm on real-world networks and on computergenerated models with known community structures. Categories and Subject Descriptors G.2.2 [Discrete Mathematics]: Graph Theory—graph algorithm...

• Type: Conference
• Year: 2006
• Where: ACMSE
• Authors: Hemant Balakrishnan, Narsingh Deo
• Keywords: ACMSE 2006, Community, Community Discovery, Community Identification, Theoretical Computer Science