A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening
Gecia Bravo-Hermsdorff, Lee M. Gunderson

TL;DR
This paper introduces a unified framework for graph sparsification and coarsening that preserves large-scale structure by leveraging the Laplacian pseudoinverse, unifying edge deletion and contraction operations.
Contribution
It provides a novel probabilistic algorithm that simultaneously sparsifies and coarsens graphs while preserving the Laplacian pseudoinverse, unifying existing methods.
Findings
The algorithm more accurately preserves large-scale graph structure.
It effectively combines sparsification and coarsening operations.
Experimental results on real datasets demonstrate improved performance.
Abstract
How might one "reduce" a graph? That is, generate a smaller graph that preserves the global structure at the expense of discarding local details? There has been extensive work on both graph sparsification (removing edges) and graph coarsening (merging nodes, often by edge contraction); however, these operations are currently treated separately. Interestingly, for a planar graph, edge deletion corresponds to edge contraction in its planar dual (and more generally, for a graphical matroid and its dual). Moreover, with respect to the dynamics induced by the graph Laplacian (e.g., diffusion), deletion and contraction are physical manifestations of two reciprocal limits: edge weights of and , respectively. In this work, we provide a unifying framework that captures both of these operations, allowing one to simultaneously sparsify and coarsen a graph while preserving its…
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
TopicsComplex Network Analysis Techniques · Advanced Graph Neural Networks · Topological and Geometric Data Analysis
