Finding community structure in networks using the eigenvectors of matrices
Finding community structure in networks using the eigenvectors of matrices
We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as ``modularity'' over possible divisions of a network. Here we …