Scalability of Network Visualisation from a Cognitive Load Perspective
Vahan Yoghourdjian, Yalong Yang, Tim Dwyer, Lee Lawrence, Michael, Wybrow, Kim Marriott

TL;DR
This study investigates how the complexity of node-link network diagrams affects users' ability to understand the network, revealing cognitive load limits and physiological responses during pathfinding tasks.
Contribution
It provides the first physiological data on cognitive load during network visualization and identifies complexity thresholds where diagrams become ineffective.
Findings
Performance drops in diagrams with over 50 nodes at high density.
EEG data shows increased brain activity with task difficulty, then decreases as users give up.
Global network features impact difficulty more than path-specific features.
Abstract
Node-link diagrams are widely used to visualise networks. However, even the best network layout algorithms ultimately result in 'hairball' visualisations when the graph reaches a certain degree of complexity, requiring simplification through aggregation or interaction (such as filtering) to remain usable. Until now, there has been little data to indicate at what level of complexity node-link diagrams become ineffective or how visual complexity affects cognitive load. To this end, we conducted a controlled study to understand workload limits for a task that requires a detailed understanding of the network topology---finding the shortest path between two nodes. We tested performance on graphs with 25 to 175 nodes with varying density. We collected performance measures (accuracy and response time), subjective feedback, and physiological measures (EEG, pupil dilation, and heart rate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
