ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software
Top Cited Papers
Open Access
- 10 June 2014
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (6) , e98679
- https://doi.org/10.1371/journal.pone.0098679
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- Hive plots--rational approach to visualizing networksBriefings in Bioinformatics, 2011
- Modularity clustering is force-directed layoutPhysical Review E, 2009
- The connected migrant: an epistemological manifestoSocial Science Information, 2008
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- Metrics for Graph Drawing AestheticsJournal of Visual Languages & Computing, 2002
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- Drawing graphs nicely using simulated annealingACM Transactions on Graphics, 1996
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991
- A hierarchical O(N log N) force-calculation algorithmNature, 1986