ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software

被引:1712
作者
Jacomy, Mathieu [1 ,2 ,3 ]
Venturini, Tommaso [1 ]
Heymann, Sebastien [3 ,4 ]
Bastian, Mathieu [3 ]
机构
[1] Medialab, Sci Po, Paris, France
[2] Equipex DIME SHS, Paris, France
[3] Gephi Consortium, Paris, France
[4] Univ Paris 06, CNRS, LIP6, Paris, France
来源
PLOS ONE | 2014年 / 9卷 / 06期
关键词
D O I
10.1371/journal.pone.0098679
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
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.
引用
收藏
页数:12
相关论文
共 21 条
[1]  
Adar E., 2006, Conference on Human Factors in Computing Systems. CHI2006, P791
[2]  
[Anonymous], 1998, Connections
[3]  
[Anonymous], 1984, Congr Numer
[4]  
[Anonymous], 2006, Mathematica journal, DOI DOI 10.3402/QHW.V6I2.5918
[5]   A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].
BARNES, J ;
HUT, P .
NATURE, 1986, 324 (6096) :446-449
[6]  
Bastian M., 2009, INT AAAI C WEBL SOC, DOI DOI 10.13140/2.1.1341.1520
[7]   Drawing graphs nicely using simulated annealing [J].
Davidson, R ;
Harel, D .
ACM TRANSACTIONS ON GRAPHICS, 1996, 15 (04) :301-331
[8]   The connected migrant: an epistemological manifesto [J].
Diminescu, Dana .
SOCIAL SCIENCE INFORMATION SUR LES SCIENCES SOCIALES, 2008, 47 (04) :565-579
[9]  
Frick A, 1994, FAST ADAPTIVE LAYOUT
[10]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164