Multi-level Graph Drawing using Infomap Clustering
Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae,, Sungpack Hong, Daniel Langerenken, Hassan Chafi

TL;DR
This paper introduces a multi-level graph drawing method that leverages Infomap clustering to improve visualization quality of large networks, demonstrating significant performance benefits.
Contribution
It combines Infomap clustering with multi-level graph drawing to enhance visualization quality for large, complex networks.
Findings
Improved visualization quality metrics.
Effective handling of large network structures.
Fast algorithm performance in practice.
Abstract
Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs. In this paper we leverage the effectiveness of Infomap clustering combined with the multi-level graph drawing paradigm. Experiments show that our new Infomap based multi-level algorithm produces good visualization of large and complex networks, with significant improvement in quality metrics.
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.
Taxonomy
TopicsData Visualization and Analytics · Complex Network Analysis Techniques · Topological and Geometric Data Analysis
