Detecting communities of triangles in complex networks using spectral optimization
arXiv:1005.3658 · doi:10.1016/j.comcom.2010.05.006
Abstract
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular structure of networks using the quality function known as modularity. However, generally speaking, the relation between topological modules and functional groups is still unknown, and depends on the semantic of the links. Sometimes, we know in advance that many connections are transitive and, as a consequence, triangles have a specific meaning. Here we propose the study of the modular structure of networks considering triangles as the building blocks of modules. The method generalizes the standard modularity and uses spectral optimization to find its maximum. We compare the partitions obtained with those resulting from the optimization of the standard modularity in several real networks. The results show that the information reported by the analysis of modules of triangles complements the information of the classical modularity analysis.
Computer Communications (in press)
References in corpus (22)
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Fast algorithm for detecting community structure in networks
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Functional cartography of complex metabolic networks
- Resolution limit in community detection
- Comparing community structure identification
- Analysis of weighted networks
- Community detection algorithms: a comparative analysis
- Community detection in complex networks using Extremal Optimization
- Community structure in directed networks
- Modularity from Fluctuations in Random Graphs and Complex Networks
- Detecting fuzzy community structures in complex networks with a Potts model
- Analysis of the structure of complex networks at different resolution levels
- Detecting Network Communities: a new systematic and efficient algorithm
- Size reduction of complex networks preserving modularity
- A Method to Find Community Structures Based on Information Centrality
- Motif-based communities in complex networks
Cited by in corpus (11)
- Community detection in networks: A user guide
- Higher-order organization of complex networks
- Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
- Magnetic eigenmaps for community detection in directed networks
- Using Triangles to Improve Community Detection in Directed Networks
- Asset allocation: new evidence through network approaches
- Coupled dynamics of node and link states in complex networks: A model for language competition
- Exploring triad-rich substructures by graph-theoretic characterizations in complex networks
- Language dynamics within adaptive networks: An agent-based approach of nodes and links coevolution
- Detecting highly cyclic structure with complex eigenpairs
- Mixed-Order Spectral Clustering for Networks