Modularity clustering is force-directed layout

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 79, Issue 2, 2009, Pages

  Noack, Andreas ^a  

^a BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

CLUSTERING QUALITIES; CLUSTERINGS; COMMUNITY STRUCTURES; DISJOINT SUBSETS; ENERGY MODELS; FORCE-DIRECTED LAYOUTS; LAYOUT QUALITIES; METRIC SPACES; OPTIMAL ENERGIES; VERTEX SETS;

TOPOLOGY;

EID: 60949111248     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.79.026102     Document Type: Article

References (44)

1. H. A. Simon, Proc. Am. Philos. Soc. 106, 467 (1962).
2. U. Brandes, in Drawing Graphs: Methods and Models, edited by, M. Kaufmann, and, D. Wagner, (Springer, Berlin, 2001), pp. 71-86.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs (Prentice-Hall, Upper Saddle River, NJ, 1999).
4. M. E. J. Newman, Eur. Phys. J. B 38, 321 (2004). 10.1140/epjb/e2004- 00124-y
5. M. Gaertler, in Network Analysis: Methodological Foundations, edited by, U. Brandes, and, T. Erlebach, (Springer, Berlin, 2005), pp. 178-215.
6. S. E. Schaeffer, Comp. Sci. Rev. 1, 27 (2007). 10.1016/j.cosrev.2007.05. 001
7. S. Fortunato and C. Castellano, e-print arXiv:0712.2716.
8. M. E. J. Newman and M. Girvan, Phys. Rev. E 69, 026113 (2004). 10.1103/PhysRevE.69.026113
9. I. Borg and P. Groenen, Modern Multidimensional Scaling: Theory and Applications (Springer, New York, 1997).
10. T. Kamada and S. Kawai, Inf. Process. Lett. 31, 7 (1989). 10.1016/0020-0190(89)90102-6
11. T. M. J. Fruchterman and E. M. Reingold, Softw.: Pract. Exp. 21, 1129 (1991). 10.1002/spe.4380211102
12. R. Davidson and D. Harel, ACM Trans. Graphics 15, 301 (1996). 10.1145/234535.234538
13. A. Noack, in Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), edited by, G. Liotta, (Springer, Berlin, 2004), pp. 425-436.
14. A. Noack, J. Graph Algorithm Appl. 11, 453 (2007).
15. A. Noack, Ph.D. thesis, Brandenburg University of Technology, 2007, http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus-4046.
16. M. E. J. Newman, Phys. Rev. E 70, 056131 (2004). 10.1103/PhysRevE.70. 056131
17. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner, IEEE Trans. Knowl. Data Eng. 20, 172 (2008). 10.1109/TKDE.2007.190689
18. S. Hachul and M. Jünger, J. Graph Algorithm Appl. 11, 345 (2007).
19. J. Barnes and P. Hut, Nature (London) 324, 446 (1986). 10.1038/324446a0
20. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas, J. Stat. Mech.: Theory Exp. (2005) P09008. 10.1088/1742-5468/2005/09/P09008
21. P. Schuetz and A. Caflisch, Phys. Rev. E 77, 046112 (2008). 10.1103/PhysRevE.77.046112
22. A. Noack and R. Rotta, e-print arXiv:0812.4073.
23. R. Diestel, Graph Theory, 2nd ed. (Springer, New York, 2000).
24. J. Reichardt and S. Bornholdt, Phys. Rev. E 74, 016110 (2006). 10.1103/PhysRevE.74.016110
25. S. Fortunato and M. Barthélemy, Proc. Natl. Acad. Sci. U.S.A. 104, 36 (2007). 10.1073/pnas.0605965104
26. P. Eades, Congr. Numer. 42, 149 (1984).
27. A. Noack, in Proceedings of the 13th International Symposium on Graph Drawing (GD 2005), edited by, P. Healy, and, N. S. Nikolov, (Springer, Berlin, 2006), pp. 309-320.
28. R. N. Shepard, Science 210, 390 (1980). 10.1126/science.210.4468.390
29. J. D. Carroll and S. Pruzansky, in Similarity and Choice: Papers in Honour of Clyde Coombs, edited by, E. D. Lantermann, and, H. Feger, (Huber, Bern, 1980), pp. 108-139.
30. S. White and P. Smyth, in Proceedings of the Fifth SIAM International Conference on Data Mining (SDM 2005) (SIAM, Philadelphia, 2005), pp. 274-285.
31. M. E. J. Newman, Phys. Rev. E 74, 036104 (2006). 10.1103/PhysRevE.74. 036104
32. N. Linial, E. London, and Y. Rabinovich, Combinatorica 15, 215 (1995). 10.1007/BF01200757
33. Y. Aumann and Y. Rabani, SIAM J. Comput. 27, 291 (1998). 10.1137/S0097539794285983
34. S. Arora, S. Rao, and U. V. Vazirani, in Proceedings of the 36th ACM Symposium on Theory of Computing (STOC 2004), edited by, L. Babai, (ACM, New York, 2004), pp. 222-231.
35. W. W. Zachary, J. Anthropol. Res. 33, 452 (1977).
36. M. E. J. Newman, Proc. Natl. Acad. Sci. U.S.A. 103, 8577 (2006). 10.1073/pnas.0601602103
37. B. H. Ross and G. L. Murphy, Cogn. Psychol. 38, 495 (1999). 10.1006/cogp.1998.0712
38. L. Hubert, P. Arabie, and J. Meulman, Combinatorial Data Analysis: Optimization by Dynamic Programming (SIAM, Philadelphia, 2001).
39. E. A. Leicht and M. E. J. Newman, Phys. Rev. Lett. 100, 118703 (2008). 10.1103/PhysRevLett.100.118703
40. M. J. Barber, Phys. Rev. E 76, 066102 (2007). 10.1103/PhysRevE.76.066102
41. M. Gaertler, R. Görke, and D. Wagner, in Proceedings of the Third International Conference on Algorithmic Aspects in Information and Management (AAIM 2007), edited by, M.-Y. Kao, and, X.-Y. Li, (Springer, Berlin, 2007), pp. 11-26.
42. http://code.google.com/p/linloglayout/.
43. http://www-personal.umich.edu/~mejn/netdata/.
44. http://www.worldbank.org, Trade and Production Database.