Energy Models for Graph Clustering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Unifying Perspective on Neighbor Embeddings along the Attraction-Repulsion Spectrum (2020, background): “This is known as edge repulsion in the graph layout literature (Noack, 2007, 2009) and is important for embedding graphs that have nodes of very di ﬀ erent degrees.”
A survey of two-dimensional graph layout techniques for information visualisation (2013, background): “The weak connection between using graph-theoretic distance and identifying low coupling between parts of the graph also hinders clustering.(38) Noack proposes two models, both with linear attractive forces between adjacent nodes and logarithmic repulsive forces.”
Spring Embedders and Force Directed Graph Drawing Algorithms (2012, methodology): “In the context of graph clustering, the LinLog model introduces an alternative energy model [55].”
ForceAtlas 2 , A Continuous Graph Layout Algorithm for Handy Network Visualization (2012, methodology): “It is not based on a new conception of force-directed layouts and it implements many features from other famous layouts [9] [6] [?].”