Reformulation of a locally optimal heuristic for modularity maximization
Résumé
A network, or graph, G = (V,E) consists of a set of vertices V = {1, . . . , n} and a set of edges E = {1, . . . ,m} connecting vertices. One of the most studied problems in the field of complex systems is to find communities, or clusters, in networks. A community consists of a subset S of the vertices of V where inner edges connecting pairs of vertices of S are more dense than cut edges connecting vertices of S to vertices of V \S. Many criteria have been proposed to evaluate partitions of V into communities.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...