Abstract
We present a force-directed layout algorithm to detect community structure within a network. Our algorithm places nodes in a two-dimensional grid and continuously updates their positions based on two opposing forces: nodes pull connected nodes closer and push non-connected nodes away. To compute the strength of the forces between nodes we make use of two insightful community properties: high-degree nodes contribute more inter-community edges than low-degree nodes and the graph-distance between two nodes is inversely proportional to the probability that they belong to the same community. We present empirical evidence in support of both of these claims. In conjunction, we use a clustering algorithm to monitor and interpret the current community structure. Running our algorithm on well-known social networks, we find that we produce accurate results that avoid some common pitfalls of alternative approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111
Davidson R, Harel D (1996) Drawing graphs nicely using simulated annealing. ACM Trans Graph 15(4):301–331
Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72:027104
Eades P (1984) A heuristic for graph drawing. Congr Numer 42:149–160
Fritzke B (1994) Growing cell structures – a self-organizing network for unsupervised and supervised learning. Neural Netw 7(9):1441–1460
Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104:36–41
Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Software Pract Exp 21(11):1129–1164
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99:7821–7826
Gleiser P, Danon L (2003) Community structure in jazz. Adv Complex Syst 6:565
Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inform Process Lett 31(1):7–15
Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond B 270(2):186–188
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113
Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133
Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577–8582
Noack A (2004) An energy model for visual graph clustering. In: Proc. symposium on graph drawing (GD 2003). LNCS, vol 2912, pp 425–436. Springer
Noack A (2007) Energy models for graph clustering. J Graph Algorithm Appl 11(2):453–480
Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithm Appl 10(2):191–218
Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658–2663
Reichardt J, Bornholdt S (2004) Discovering functional communities in dynamical networks. Phys Rev Lett E 93:218710
Tasgin M, Bingol H (2006) Community detection in complex networks using genetic algorithms. ECCS Oxford, UK
Zachary WW (1977) An Information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer
About this paper
Cite this paper
McSweeney, P.J., Mehrotra, K., Oh, J.C. (2010). A Force-Directed Layout for Community Detection with Automatic Clusterization. In: Takadama, K., Cioffi-Revilla, C., Deffuant, G. (eds) Simulating Interacting Agents and Social Phenomena. Agent-Based Social Systems, vol 7. Springer, Tokyo. https://doi.org/10.1007/978-4-431-99781-8_4
Download citation
DOI: https://doi.org/10.1007/978-4-431-99781-8_4
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-99780-1
Online ISBN: 978-4-431-99781-8
eBook Packages: Computer ScienceComputer Science (R0)