ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software
Mathieu Jacomy, Tommaso Venturini, Sébastien Heymann et al. · PLoS ONE · 2014
Gephi is a network visualization software used in various disciplines (social network analysis, biology, genomics...). One of its key features is the ability to display the spatialization process, aiming at transforming the network into a map, and ForceAtlas2 is its default layout algorithm. The latter is developed by the Gephi team as an all-around solution to Gephi users' typical networks (scale-free, 10 to 10,000 nodes). We present here for the first time its functioning and settings. ForceAtlas2 is a force-directed layout close to other algorithms used for network spatialization. We do not claim a theoretical advance but an attempt to integrate different techniques such as the Barnes Hut simulation, degree-dependent repulsive force, and local and global adaptive temperatures. It is designed for the Gephi user experience (it is a continuous algorithm), and we explain which constraints it implies. The algorithm benefits from much feedback and is developed in order to provide many possibilities through its settings. We lay out its complete functioning for the users who need a precise understanding of its behaviour, from the formulas to graphic illustration of the result. We propose a benchmark for our compromise between performance and quality. We also explain why we integrated its various features and discuss our design choices.
Cited by 2,902 works. doi:10.1371/journal.pone.0098679 Open-access PDF
Authors
References
- Authoritative sources in a hyperlinked environment
- Authoritative sources in a hyperlinked environment
- Modularity and community structure in networks
- Graph drawing by force‐directed placement
- A hierarchical O(N log N) force-calculation algorithm
- Gephi: An Open Source Software for Exploring and Manipulating Networks
- An algorithm for drawing general undirected graphs
- Pajek - Program for Large Network Analysis
- A Heuristic for Graph Drawing
- Analysis of weighted networks