Graffinity: Visualizing Connectivity In Large Graphs

by   Ethan Kerzner, et al.

Multivariate graphs are prolific across many fields, including transportation and neuroscience. A key task in graph analysis is the exploration of connectivity, to, for example, analyze how signals flow through neurons, or to explore how well different cities are connected by flights. While standard node-link diagrams are helpful in judging connectivity, they do not scale to large networks. Adjacency matrices also do not scale to large networks and are only suitable to judge connectivity of adjacent nodes. A key approach to realize scalable graph visualization are queries: instead of displaying the whole network, only a relevant subset is shown. Query-based techniques for analyzing connectivity in graphs, however, can also easily suffer from cluttering if the query result is big enough. To remedy this, we introduce techniques that provide an overview of the connectivity and reveal details on demand. We have two main contributions: (1) two novel visualization techniques that work in concert for summarizing graph connectivity; and (2) Graffinity, an open-source implementation of these visualizations supplemented by detail views to enable a complete analysis workflow. Graffinity was designed in a close collaboration with neuroscientists and is optimized for connectomics data analysis, yet the technique is applicable across domains. We validate the connectivity overview and our open-source tool with illustrative examples using flight and connectomics data.


On the complexity of structure and substructure connectivity of graphs

The connectivity of a graph is an important parameter to measure its rel...

Juniper: A Tree+Table Approach to Multivariate Graph Visualization

Analyzing large, multivariate graphs is an important problem in many dom...

GraphTSNE: A Visualization Technique for Graph-Structured Data

We present GraphTSNE, a novel visualization technique for graph-structur...

Nebula Graph: An open source distributed graph database

This paper introduces the recent work of Nebula Graph, an open-source, d...

Pegasus: The second connectivity graph for large-scale quantum annealing hardware

Pegasus is a graph which offers substantially increased connectivity bet...

Graph Sampling with Distributed In-Memory Dataflow Systems

Given a large graph, a graph sample determines a subgraph with similar c...

Scalable Comparative Visualization of Ensembles of Call Graphs

Optimizing the performance of large-scale parallel codes is critical for...

Please sign up or login with your details

Forgot password? Click here to reset