https://doi.org/10.1140/epjb/e2004-00124-y
Detecting community structure in networks
Department of Physics and Center for the Study of Complex
Systems, University of Michigan, Ann Arbor, MI 48109–1120, USA
Corresponding author: a mejn@umich.edu
Received:
10
November
2003
Published online:
14
May
2004
There has been considerable recent interest in algorithms for finding communities in networks—groups of vertices within which connections are dense, but between which connections are sparser. Here we review the progress that has been made towards this end. We begin by describing some traditional methods of community detection, such as spectral bisection, the Kernighan–Lin algorithm and hierarchical clustering based on similarity measures. None of these methods, however, is ideal for the types of real-world network data with which current research is concerned, such as Internet and web data and biological and social networks. We describe a number of more recent algorithms that appear to work well with these data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks.
PACS: 89.75.Hc – Networks and genealogical trees / 87.23.Ge – Dynamics of social systems / 89.20.Hh – World Wide Web, Internet / 05.10.-a – Computational methods in statistical physics and nonlinear dynamics
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004
