Network community structure and loop coefficient method
Authors:
- 11 July 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 74 (1) , 016105
Abstract
A modular structure, in which groups of tightly connected nodes could be resolved as separate entities, is a property that can be found in many complex networks. In this paper, we propose a algorithm for identifying communities in networks. It is based on a local measure, so-called loop coefficient that is a generalization of the clustering coefficient. Nodes with a large loop coefficient tend to be core inner community nodes, while other vertices are usually peripheral sites at the borders of communities. Our method gives satisfactory results for both artificial and real-world graphs, if they have a relatively pronounced modular structure. This type of algorithm could open a way of interpreting the role of nodes in communities in terms of the local loop coefficient, and could be used as a complement to other methods.Keywords
This publication has 36 references indexed in Scilit:
- Local method for detecting communitiesPhysical Review E, 2005
- Community detection in complex networks using extremal optimizationPhysical Review E, 2005
- Identifying communities within energy landscapesPhysical Review E, 2005
- Finding community structure in very large networksPhysical Review E, 2004
- Role of clustering and gridlike ordering in epidemic spreadingPhysical Review E, 2004
- Finding communities in linear time: a physics approachThe European Physical Journal B, 2004
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002
- Network motifs in the transcriptional regulation network of Escherichia coliNature Genetics, 2002
- Extremal optimization for graph partitioningPhysical Review E, 2001
- Optimization with Extremal DynamicsPhysical Review Letters, 2001