Community Detection on Networks with Ricci Flow

Abstract

Many complex networks in the real world have community structures -- groups of well-connected nodes with important functional roles. It has been well recognized that the identification of communities bears numerous practical applications. While existing approaches mainly apply statistical or graph theoretical/combinatorial methods for community detection, in this paper, we present a novel geometric approach which enables us to borrow powerful classical geometric methods and properties. By considering networks as geometric objects and communities in a network as a geometric decomposition, we apply curvature and discrete Ricci flow, which have been used to decompose smooth manifolds with astonishing successes in mathematics, to break down communities in networks. We tested our method on networks with ground-truth community structures, and experimentally confirmed the effectiveness of this geometric approach.

29 pages, 18 figures, to be appeared on Scientific Reports

References in corpus (8)

• Modularity and community structure in networks
• Maps of random walks on complex networks reveal community structure
• Near linear time algorithm to detect community structures in large-scale networks
• Resolution limit in community detection
• Statistical Mechanics of Community Detection
• Ricci Flow and the Poincare Conjecture
• Triadic closure as a basic generating mechanism of communities in complex networks
• Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity