Detecting communities in large networks

Abstract

We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since the method detects efficiently clustered nodes in large networks even when these are not sharply partitioned, it turns to be specially suitable to the analysis of social and information networks. We test the algorithm on a large-scale data-set from a psychological experiment of word association. In this case, it proves to be successful both in clustering words and in uncovering mental association patterns.

4 pages with 2 figures; revtex. Minor changes in the abstract

References in corpus (12)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Community structure in social and biological networks
• Assortative mixing in networks
• Evolution of networks
• Self-similar community structure in organisations
• Large-scale topological and dynamical properties of Internet
• Curvature of Co-Links Uncovers Hidden Thematic Layers in the World Wide Web
• Global Organization of the Lexicon
• Number of loops of size h in growing scale-free networks
• Quantitative description and modeling of real networks

Cited by in corpus (60)

• Community detection in graphs
• Finding community structure in networks using the eigenvectors of matrices
• Analysis of weighted networks
• Characterization of complex networks: A survey of measurements
• Synchronization reveals topological scales in complex networks
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Clustering and Community Detection in Directed Networks: A Survey
• Fuzzy communities and the concept of bridgeness in complex networks
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• Preferential attachment in the growth of social networks: the case of Wikipedia
• A fitness model for the Italian Interbank Money Market
• Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
• Synchronization processes in complex networks
• Spectral coarse-graining of complex networks
• Laplacian Spectra as a Diagnostic Tool for Network Structure and Dynamics
• Strong correlations between text quality and complex networks features
• Spectral methods for the detection of network community structure: a comparative analysis
• Community Detecting By Signaling on Complex Networks
• Spectral tripartitioning of networks
• A New Comparative Definition of Community and Corresponding Identifying Algorithm
• Communicability Graph and Community Structures in Complex Networks
• Topologically biased random walk with application for community finding in networks
• Accuracy and Precision of Methods for Community Identification in Weighted Networks
• Covariance, correlation matrix and the multi-scale community structure of networks
• Trading strategies in the Italian interbank market
• Communities in Networks
• Analysis of Nonlinear Synchronization Dynamics of Oscillator Networks by Laplacian Spectral Methods
• Limitation of multi-resolution methods in community detection
• Communicability and multipartite structures in complex networks at negative absolute temperatures
• Spectral Detection of Simplicial Communities via Hodge Laplacians
• Maximal entropy random walk in community finding
• Analysis of stability of community structure across multiple hierarchical levels
• A divisive spectral method for network community detection
• LabelRank: A Stabilized Label Propagation Algorithm for Community Detection in Networks
• Hierarchical organization of brain functional network during visual task
• Enhancing community detection by local structural information
• Communication and correlation among communities
• Non-parametric resampling of random walks for spectral network clustering
• Community detection based on first passage probabilities
• Partition of Networks into Basins of Attraction
• Self-organized Emergence of Navigability on Small-World Networks
• Two transitions in spatial modular networks
• Emergence of Clustering in an Acquaintance Model without Homophily
• Eigenvector localization as a tool to study small communities in online social networks
• Fast Community Identification by Hierarchical Growth
• Scalable Spectral Algorithms for Community Detection in Directed Networks
• Graph Theory and Networks in Biology
• Network Community Detection on Metric Space
• Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q
• When are recommender systems useful?
• Comprehensive spectral approach for community structure analysis on complex networks
• Entropic Spectral Learning for Large-Scale Graphs
• Extracting Hidden Groups and their Structure from Streaming Interaction Data
• Designing topological cluster synchronization patterns with the Dirac operator
• Long-time tails in sheared fluids
• Clustering evolving data using kernel-based methods
• Small-world of communities: communication and correlation of the meta-network
• Dynamic Ising Model: Reconstruction of Evolutionary Trees
• Synthesis and Implementation of Distributed Supervisory Controllers with Communication Delays
• Spectral Complexity of Directed Graphs and Application to Structural Decomposition