Modularity clustering is force-directed layout
Top Cited Papers
- 2 February 2009
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 79 (2) , 026102
- https://doi.org/10.1103/physreve.79.026102
Abstract
Two natural and widely used representations for the community structure of networks are clusterings, which partition the vertex set into disjoint subsets, and layouts, which assign the vertices to positions in a metric space. This paper unifies prominent characterizations of layout quality and clustering quality, by showing that energy models of pairwise attraction and repulsion subsume Newman and Girvan’s modularity measure. Layouts with optimal energy are relaxations of, and are thus consistent with, clusterings with optimal modularity, which is of practical relevance because the two representations are complementary and often used together.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Efficient modularity optimization by multistep greedy algorithm and vertex mover refinementPhysical Review E, 2008
- Community Structure in Directed NetworksPhysical Review Letters, 2008
- Modularity and community detection in bipartite networksPhysical Review E, 2007
- Resolution limit in community detectionProceedings of the National Academy of Sciences, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Comparing community structure identificationJournal of Statistical Mechanics: Theory and Experiment, 2005
- Analysis of weighted networksPhysical Review E, 2004
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- Drawing graphs nicely using simulated annealingACM Transactions on Graphics, 1996
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995