• Corpus ID: 16613603

ForceAtlas2, A Graph Layout Algorithm for Handy Network Visualization

@inproceedings{Jacomy2011ForceAtlas2AG,
  title={ForceAtlas2, A Graph Layout Algorithm for Handy Network Visualization},
  author={Mathieu Jacomy and Mathieu Bastian},
  year={2011}
}
ForceAtlas2 is a force vector algorithm proposed in the Gephi software, appreciated for its simplicity and for the readability of the networks it helps to visualize. This paper presents its distinctive features, its energy-model and the way it optimizes the “speed versus precision” approximation to allow quick convergence. We also claim that ForceAtlas2 is handy because the force vector principle is unaffected by optimizations, offering a smooth and accurate experience to users. 
PARALLEL IMPLEMENTATION OF FORCE ALGORITHMS FOR GRAPH VISUALIZATION
TLDR
The experimental results ground the proposal of a parallelized version of an algorithm (the Force Atlas 2) and the corresponding performance analysis, and a comparative review of graph visualization algorithms.
graphTPP: A multivariate based method for interactive graph layout and analysis
TLDR
This article presents graphTPP, a graph based extension to targeted projection pursuit (TPP) --- an interactive, linear, dimension reduction technique --- as a method for graph layout and subsequent further analysis that allows users to control the projection and is optimised for clustering.
Optimization Equivalence of Divergences Improves Neighbor Embedding
TLDR
A theorem of optimization equivalences between β- and γ-, as well as α- and Renyi-divergences through a connection scalar is proved, making it possible to relate methods from the two approaches and to build new methods that take the best of both worlds.
Planar Graph Generation with Application to Water Distribution Networks
TLDR
This thesis presents a flexible method to generate realistic water distribution networks with optimized network parameters such as pipe and tank diameters, tank minimum and maximum levels, and pump sizes using the multi-scale randomized editing of a known water network.
Evaluating Layout and Clustering Algorithms for Visualizing Named Entity Graph
TLDR
This paper intends to assist the researchers by presenting the performance evaluation of the combination of graph layout algorithm followed by a clustering algorithm on bio-named entities that are linked by some annotated relations.
DataEx: Interactive Relationship Explorer of Freebase Knowledge Repository
TLDR
DataEx, a HTML5 client-side Web application, which aims to make Web data more accessible by utilizing visualization as an useful approach to explore and navigate through large amounts of data and ultimately emphasize the relations between them.
Visualization for Streaming Networks
TLDR
This work treats the data like a continuous data stream and represents it by sampling the full network, and proposes group visualization and analysis of influential actors in the network by using a Top-K representation of the network data stream.
A survey of two-dimensional graph layout techniques for information visualisation
TLDR
A detailed assessment of currently available graph layout techniques is provided, specifically how they can be used by visualisation practitioners, and to motivate further research in the area.
Hierarchatomy: Modelling and Automatic 2D Visualization of Branching Anatomical Structures
TLDR
A model that automatically visualizes branching anatomical structures like the vascular or nervous system in such a way that the 2D drawing space is optimally utilized is presented.
Visualization for Streaming Telecommunications Networks
TLDR
This contribution is a group visualization and analysis technique of influential actors in the network by sampling the full network with a top-k representation of the network data stream.
...
...

References

SHOWING 1-10 OF 13 REFERENCES
Gephi: An Open Source Software for Exploring and Manipulating Networks
TLDR
This work presents several key features of Gephi in the context of interactive exploration and interpretation of networks, and highlights key aspects of dynamic network visualization.
Efficient, High-Quality Force-Directed Graph Drawing
TLDR
This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut octree technique, which approximates short and long-range force efficiently.
Graph drawing by force‐directed placement
TLDR
A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Modularity clustering is force-directed layout
  • A. Noack
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
TLDR
This paper unifies prominent characterizations of layout quality and clustering quality, by showing that energy models of pairwise attraction and repulsion subsume Newman and Girvan's modularity measure.
OpenOrd: an open-source toolbox for large graph layout
TLDR
An open-source toolbox for drawing large-scale undirected graphs based on a previously implemented closed-source algorithm known as VxOrd, which is extended by incorporating edge-cutting, a multi-level approach, average-link clustering, and a parallel implementation.
Energy Models for Graph Clustering
  • A. Noack
  • Computer Science
    J. Graph Algorithms Appl.
  • 2007
TLDR
Two energy models whose minimum energy layouts represent the cluster structure of graph clusterings are introduced, one based on repulsion between nodes (like most existing energy models) and onebased onRepulsion between edges.
Analysis of weighted networks.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is pointed out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighting graphs to weighted ones as well.
Modularity and community structure in networks.
  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
TLDR
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.
A hierarchical O(N log N) force-calculation algorithm
TLDR
A novel method of directly calculating the force on N bodies that grows only as N log N is described, using a tree-structured hierarchical subdivision of space into cubic cells, each is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell.
The connected migrant: an epistemological manifesto
Current trends in thinking on contemporary migration (in particular, theories on transnational networks) agree that today's migrants are the actors of a culture of bonds, which they themselves have
...
...