SSumM: Sparse Summarization of Massive Graphs

Given a graph 𝐺 and the desired size 𝑘 in bits, how can we summarize 𝐺 within 𝑘 bits, while minimizing the information loss? Large-scale graphs have become omnipresent, posing considerable computational challenges. Analyzing such large graphs can be fast and easy if they are compressed sufficiently to fit in main memory or even cache. Graph summarization, which yields a coarsegrained summary graph with merged nodes, stands out with several advantages among graph compression techniques. Thus, a number of algorithms have been developed for obtaining a concise summary graph with little information loss or equivalently small reconstruction error. However, the existing methods focus solely on reducing the number of nodes, and they often yield dense summary graphs, failing to achieve better compression rates. Moreover, due to their limited scalability, they can be applied only to moderate-size graphs. In this work, we propose SSumM, a scalable and effective graphsummarization algorithm that yields a sparse summary graph. SSumM not only merges nodes together but also sparsifies the summary graph, and the two strategies are carefully balanced based on the minimum description length principle. Compared with stateof-the-art competitors, SSumM is (a) Concise: yields up to 11.2× smaller summary graphs with similar reconstruction error, (b) Accurate: achieves up to 4.2× smaller reconstruction error with similarly concise outputs, and (c) Scalable: summarizes 26× larger graphs while exhibiting linear scalability. We validate these advantages through extensive experiments on 10 real-world graphs.