ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software
By Mathieu Jacomy, Tommaso Venturini, Sebastien Heymann, Mathieu Bastian. 2014
2,784 citations recorded by the source corpus.
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.
Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics, Graph Learning, Software Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Gorkem Bostanci
- Aviv Regev
- Aristides Gionis
- Philipp Berens
- Jo Vermeulen
- Blaz Zupan
- Yaron Shaposhnik
- Brian Y. Lim
In Computer Vision and Pattern Recognition
- Ashraf Abdul
- Danding Wang
- Jo Vermeulen
- Haiyang Huang
- Mohan Kankanhalli
- Gorkem Bostanci
- Aviv Regev
- F. Alexander Wolf
In Statistical and Nonlinear Physics
- Gorkem Bostanci
- Aviv Regev
- Berthold Göttgens
- F. Alexander Wolf
- Aristides Gionis
- Philipp Berens
- Venkata Rama Kiran Garimella
- Jo Vermeulen
In Graph Learning
- Gorkem Bostanci
- Berthold Göttgens
- F. Alexander Wolf
- Aristides Gionis
- Blaz Zupan
- Nikolaus Rajewsky
- Mireya Plass
- Fiona Kathryn Hamey
In Software Engineering
Citations in the corpus
- Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualization (2020, methodology): “It is also worth mentioning that in ForceAtlas2, the repulsive force is applied to every pair of points in the low-dimensional embedding – even the neighbors.”
- openTSNE: a modular Python library for t-SNE dimensionality reduction and embedding (2019, background): “Other dimensionality reduction methods, such as UMAP and ForceAtlas2, produce embed-dings where clusters appear more compact, and the white space separating the clusters may be interpreted as a loose measure of distance.”
- Graph abstraction reconciles clustering with trajectory inference through a topology preserving map of single cells (2017, methodology): “This phenomenon is frequently encountered in graph drawing algorithms such as ForceAtlas2 [23].”
- Trends and Trajectories for Explainable, Accountable and Intelligible Systems: An HCI Research Agenda (2018, methodology): “The resulting topic network was then visualized using the ForceAtlas2 algorithm [83] in Gephi [11].”
- Fast Batch Alignment of Single Cell Transcriptomes Unifies Multiple Mouse Cell Atlases into an Integrated Landscape (2018, methodology): “The resulting graph can be directly used as the input for downstream analyses such as clustering 16 and diffusion pseudotime 17 , with compatible dimensionality reduction visualisation approaches including UMAP 18 and force-directed graphs 19 .”
- Robust mapping of spatiotemporal trajectories and cell–cell interactions in healthy and diseased tissues (2023, neutral): “Data were visualised in both UMAP and ForceAtlas2 space 59 (Fig.”
- Estimating Global Bank Network Connectedness (2017, positive): “We determine node location using the ForceAtlas2 algorithm of Jacomy et al. (2014) as implemented in Gephi.”
- Bifidobacteria-mediated immune system imprinting early in life (2020, methodology): “Finally, the trajectory mapwas used as the initial position and the scatters of single cells were embedded with ForceAtlas2 (Jacomy et al., 2014) for visualization.”
- PAGA: graph abstraction reconciles clustering with trajectory inference through a topology preserving map of single cells (2019, positive): “topology-preserving single-cell embeddings The computationally almost cost-free coarse-resolution embeddings of PAGA can be used to initialize established manifold learning and graph drawing algorithms like UMAP [22] and ForceAtlas2 (FA) [23].”
- Quantifying Controversy in Social Media (2015, methodology): “The graph layout is produced by Gephi’s ForceAtlas2 algorithm [16], and is based solely on the structure of the graph, not on the partitioning computed by METIS.”
- A Unifying Perspective on Neighbor Embeddings along the Attraction-Repulsion Spectrum (2020, background): “All three algorithms discussed in this manuscript (t-SNE, UMAP, ForceAtlas2) are widely used in several academic fields, e.g. single-cell biology (Becht et al., 2019; Kobak and Berens, 2019) or population genomics (Diaz-Papkovich et al., 2019; Karczewski et al., 2020), but the choice of the method is”
- How connected is the global sovereign credit risk network? (2020, positive): “Node Location Indicates Strength of Average Pairwise Directional Connectedness Locations of the nodes are determined by the ForceAtlas2 algorithm of Jacomy et al. (2014) as implemented in Gephi.”
- Automated Mapping of Phenotype Space with Single-Cell Data (2016, methodology): “The resulting graph was subject to force-directed layout using ForceAtlas2 algorithm 27 .”
- From Local to Global: A Graph RAG Approach to Query-Focused Summarization (2024, methodology): “Node layout was performed via OpenORD (Martin et al., 2011) and Force Atlas 2 (Jacomy et al., 2014).”