inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition (2402.16990v2)
Abstract: This work presents inGRASS, a novel algorithm designed for incremental spectral sparsification of large undirected graphs. The proposed inGRASS algorithm is highly scalable and parallel-friendly, having a nearly-linear time complexity for the setup phase and the ability to update the spectral sparsifier in $O(\log N)$ time for each incremental change made to the original graph with $N$ nodes. A key component in the setup phase of inGRASS is a multilevel resistance embedding framework introduced for efficiently identifying spectrally-critical edges and effectively detecting redundant ones, which is achieved by decomposing the initial sparsifier into many node clusters with bounded effective-resistance diameters leveraging a low-resistance-diameter decomposition (LRD) scheme. The update phase of inGRASS exploits low-dimensional node embedding vectors for efficiently estimating the importance and uniqueness of each newly added edge. As demonstrated through extensive experiments, inGRASS achieves up to over $200 \times$ speedups while retaining comparable solution quality in incremental spectral sparsification of graphs obtained from various datasets, such as circuit simulations, finite element analysis, and social networks.
- J. Batson, D. Spielman, and N. Srivastava, “Twice-Ramanujan Sparsifiers,” SIAM Journal on Computing, vol. 41, no. 6, pp. 1704–1721, 2012.
- D. Spielman and S. Teng, “Spectral sparsification of graphs,” SIAM Journal on Computing, vol. 40, no. 4, pp. 981–1025, 2011.
- Y. T. Lee and H. Sun, “An sdp-based algorithm for linear-sized spectral sparsification,” in Proceedings of the 49th annual acm sigact symposium on theory of computing, 2017, pp. 678–687.
- I. Koutis, G. Miller, and R. Peng, “Approaching Optimality for Solving SDD Linear Systems,” in Proc. IEEE FOCS, 2010, pp. 235–244.
- Z. Feng, “Spectral graph sparsification in nearly-linear time leveraging efficient spectral perturbation analysis,” in Proceedings of the 53rd Annual Design Automation Conference. ACM, 2016, p. 57.
- Z. Feng, “Similarity-aware spectral sparsification by edge filtering,” in Design Automation Conference (DAC), 2018 55nd ACM/EDAC/IEEE. IEEE, 2018.
- Z. Feng, “Grass: Graph spectral sparsification leveraging scalable spectral perturbation analysis,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 12, pp. 4944–4957, 2020.
- Z. Liu, W. Yu, and Z. Feng, “fegrass: Fast and effective graph spectral sparsification for scalable power grid analysis,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 41, no. 3, pp. 681–694, 2022.
- Y. Zhang, Z. Zhao, and Z. Feng, “Sf-grass: solver-free graph spectral sparsification,” in Proceedings of the 39th International Conference on Computer-Aided Design, 2020, pp. 1–8.
- Z. Liu and W. Yu, “Pursuing more effective graph spectral sparsifiers via approximate trace reduction,” in Proceedings of the 59th ACM/IEEE Design Automation Conference, 2022, pp. 613–618.
- M. Kapralov, A. Mousavifar, C. Musco, C. Musco, N. Nouri, A. Sidford, and J. Tardos, “Fast and space efficient spectral sparsification in dynamic streams,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2020, pp. 1814–1833.
- A. Filtser, M. Kapralov, and N. Nouri, “Graph spanners by sketching in dynamic streams and the simultaneous communication model,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 2021, pp. 1894–1913.
- D. A. Spielman and N. Srivastava, “Graph sparsification by effective resistances,” in Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, pp. 563–568.
- T. Chu, Y. Gao, R. Peng, S. Sachdeva, S. Sawlani, and J. Wang, “Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions,” SIAM Journal on Computing, no. 0, pp. FOCS18–85, 2020.
- I. Abraham and O. Neiman, “Using petal-decompositions to build a low stretch spanning tree,” in Proceedings of the forty-fourth annual ACM symposium on Theory of computing (STOC). ACM, 2012, pp. 395–406.
- J. Liesen and Z. Strakos, “Krylov subspace methods: principles and analysis.” Numerical Mathematics and Scie, 2013.
- A. Aghdaei and Z. Feng, “Hyperef: Spectral hypergraph coarsening by effective-resistance clustering,” in Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, 2022, pp. 1–9.