Effective-Resistance Preserving Spectral Reduction of Graphs
Effective-Resistance Preserving Spectral Reduction of Graphs
复制标题
DOI:
10.1145/3316781.3317809
复制
发表时间:
2019-06
期刊:
影响因子:
--
通讯作者:
Zhiqiang Zhao;Zhuo Feng
中科院分区:
文献类型:
--
作者:
Zhiqiang Zhao;Zhuo Feng
This paper proposes a scalable algorithmic framework for effective-resistance preserving spectral reduction of large undirected graphs. The proposed method allows computing much smaller graphs while preserving the key spectral (structural) properties of the original graph. Our framework is built upon the following three key components: a spectrum-preserving node aggregation and reduction scheme, a spectral graph sparsification framework with iterative edge weight scaling, as well as effective-resistance preserving post-scaling and iterative solution refinement schemes. By leveraging recent similarity-aware spectral sparsification method and graph-theoretic algebraic multigrid (AMG) Laplacian solver, a novel constrained stochastic gradient descent (SGD) optimization approach has been proposed for achieving truly scalable performance (nearly-linear complexity) for spectral graph reduction. We show that the resultant spectrally-reduced graphs can robustly preserve the first few nontrivial eigenvalues and eigenvectors of the original graph Laplacian and thus allow for developing highly-scalable spectral graph partitioning and circuit simulation algorithms.ACM Reference Format:Zhiqiang Zhao and Zhuo Feng. 2019. Effective-Resistance Preserving Spectral Reduction of Graphs. In The 56th Annual Design Automation Conference 2019 (DAC '19), June 2–6, 2019, Las Vegas, NV, USA. ACM, New York, NY, USA, 6 pages. https://doi.org/10.1145/3316781.3317809