## Energy Models for Graph Clustering

### Cached

### Download Links

- [www.cs.brown.edu]
- [www-sst.informatik.tu-cottbus.de]
- [jgaa.info]
- [www.emis.de]
- [www.emis.math.ca]
- [emis.maths.tcd.ie]
- [www.maths.tcd.ie]
- DBLP

### Other Repositories/Bibliography

Citations: | 15 - 1 self |

### BibTeX

@MISC{Noack_energymodels,

author = {Andreas Noack},

title = {Energy Models for Graph Clustering},

year = {}

}

### OpenURL

### Abstract

The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software systems. Layouts can naturally represent the cluster structure of graphs by grouping densely connected nodes and separating sparsely connected nodes. This article introduces two energy models whose minimum energy layouts represent the cluster structure, one based on repulsion between nodes (like most existing energy models) and one based on repulsion between edges. The latter model is not biased towards grouping nodes with high degrees, and is thus more appropriate for the many real-world graphs with right-skewed degree distributions. The two energy models are shown to be closely related to widely used quality criteria for graph clusterings – namely the density of the cut, Shi and Malik’s normalized cut, and Newman’s modularity – and to objective functions optimized by eigenvector-based graph drawing methods.