An Energy Model for Visual Graph Clustering

We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes outside the set. The drawings of the best-known force and energy models do not clearly show clusters for graphs whose diameter is small relative to the number of nodes. We formally characterize the minimum energy drawings of our energy model. This characterization shows in what sense the drawings separate clusters, and how the distance of separated clusters to the other nodes can be interpreted.

[1]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[2]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[3]  Claus Lewerentz,et al.  CrocoCosmos - 3D Visualization of Large Object-Oriented Programs , 2004, Graph Drawing Software.

[4]  Emden R. Gansner,et al.  Using automatic clustering to produce high-level system organizations of source code , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[5]  Ulrik Brandes,et al.  Drawing on Physical Analogies , 2001, Drawing Graphs.

[6]  Alex Pothen,et al.  Graph Partitioning Algorithms with Applications to Scientific Computing , 1997 .

[7]  A. Zients.  Andy , 2003 .

[8]  Michael T. Goodrich,et al.  A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs , 2000, Graph Drawing.

[9]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

[10]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[11]  Sabine Cornelsen,et al.  Drawing Clusters and Hierarchies , 1999, Drawing Graphs.

[12]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[13]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

[14]  William B. Cowan,et al.  Human Perception of Laid-Out Graphs , 1998, Graph Drawing.

[15]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[16]  Ulrik Brandes,et al.  Journal of Graph Algorithms and Applications Visual Ranking of Link Structures , 2022 .

[17]  Andreas Noack,et al.  Energy Models for Drawing Clustered Small-World Graphs? , 2003 .

[18]  Xiaobo Wang,et al.  Generating Customized Layouts , 1995, Graph Drawing.

[19]  Daniel Tunkelang,et al.  A Numerical Optimization Approach to General Graph Drawing , 1999 .

[20]  Franz-Josef Brandenburg,et al.  An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms , 1995, GD.

[21]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[22]  Myron Wish,et al.  Three-Way Multidimensional Scaling , 1978 .

[23]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[24]  David Harel,et al.  A Fast Multi-scale Method for Drawing Large Graphs , 2000, Graph Drawing.

[25]  Peter Eades,et al.  FADE: Graph Drawing, Clustering, and Visual Abstraction , 2000, GD.

[26]  David Harel,et al.  ACE: a fast multiscale eigenvectors computation for drawing huge graphs , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[27]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[28]  Jim Blythe,et al.  The Effect of Graph Layout on Inference from Social Network Data , 1995, GD.