Consistent Community Identification in Complex Networks

Abstract

We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We propose two metrics to quantify the level of consistency across multiple runs of an algorithm: pairwise membership probability and consistency. Based on these two metrics, we address the consistency problem without compromising the modularity. Our solution uses pairwise membership probabilities as link weights and generates consistent communities within six or fewer cycles. It offers a new tool in the study of community structures and their evolutions.

4 pages, 4 figures

References in corpus (10)

• Fast unfolding of communities in large networks
• Community structure in social and biological networks
• Finding community structure in very large networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Cooperative Game Theory Approaches for Network Partitioning
• Maps of random walks on complex networks reveal community structure
• Resolution limit in community detection
• Defining and identifying communities in networks
• Finding Community Structure in Mega-scale Social Networks
• Comparison and validation of community structures in complex networks

Cited by in corpus (3)

• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Community consistency determines the stability transition window of power-grid nodes
• Consistency landscape of network communities