Zhiqiang Zhao
ABSTRACT
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.
- C. J. Alpert. The ispd98 circuit benchmark suite. In Proceedings of the 1998 international symposium on Physical design, pages 80--85. ACM, 1998. Google Scholar
Digital Library
- D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner. Graph partitioning and graph clustering. In 10th DIMACS Implementation Challenge Workshop, 2012.Google Scholar
- J. Batson, D. Spielman, and N. Srivastava. Twice-Ramanujan Sparsifiers. SIAM Journal on Computing, 41(6):1704--1721, 2012.Google ScholarCross Ref
- W. L. Briggs, S. F. McCormick, et al. A multigrid tutorial, volume 72. Siam, 2000. Google ScholarCross Ref
- J. Chen and I. Safro. Algebraic distance on graphs. SIAM Journal on Scientific Computing, 33(6):3468--3490, 2011. Google ScholarDigital Library
- P. Christiano, J. Kelner, A. Madry, D. Spielman, and S. Teng. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In Proc. ACM STOC, pages 273--282, 2011. Google ScholarDigital Library
- T. Davis and Y. Hu. The university of florida sparse matrix collection. ACM Trans. on Math. Soft. (TOMS), 38(1):1, 2011. Google ScholarDigital Library
- M. Defferrard, X. Bresson, and P. Vandergheynst. Convolutional neural networks on graphs with fast localized spectral filtering. In Advances in Neural Information Processing Systems, pages 3844--3852, 2016. Google ScholarDigital Library
- M. Elkin, Y. Emek, D. A. Spielman, and N. Srivastava. Lower-stretch spanning trees. SIAM Journal on Computing, 38(2):608--628, 2008. Google ScholarDigital Library
- Z. Feng. Spectral graph sparsification in nearly-linear time leveraging efficient spectral perturbation analysis. In Design Automation Conference (DAC), 2016 53nd ACM/EDAC/IEEE, pages 1--6. IEEE, 2016. Google ScholarDigital Library
- Z. Feng. Similarity-aware spectral sparsification by edge filtering. In Design Automation Conference (DAC), 2018 55nd ACM/EDAC/IEEE. IEEE, 2018. Google ScholarDigital Library
- G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multilevel hypergraph partitioning: applications in vlsi domain. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7(1):69--79, 1999. Google ScholarDigital Library
- Y. Koren. On spectral graph drawing. In International Computing and Combinatorics Conference, pages 496--508. Springer, 2003. Google ScholarDigital Library
- J. R. Lee, S. O. Gharan, and L. Trevisan. Multiway spectral partitioning and higher-order cheeger inequalities. Journal of the ACM (JACM), 61(6):37, 2014. Google ScholarDigital Library
- O. Livne and A. Brandt. Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver. SIAM Journal on Scientific Computing, 34(4):B499--B522, 2012.Google ScholarDigital Library
- Y. Saad. Iterative methods for sparse linear systems, volume 82. siam, 2003. Google ScholarCross Ref
- D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine, 30(3):83--98, 2013.Google ScholarCross Ref
- D. Spielman and S. Teng. Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. SIAM Journal on Matrix Analysis and Applications, 35(3):835--885, 2014.Google ScholarDigital Library
- D. A. Spielman and N. Srivastava. Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6):1913--1926, 2011. Google ScholarDigital Library
- I. Sutskever, J. Martens, G. Dahl, and G. Hinton. On the importance of initialization and momentum in deep learning. In International conference on machine learning, pages 1139--1147, 2013. Google ScholarDigital Library
- S.-H. Teng. Scalable algorithms for data and network analysis. Foundations and Trends® in Theoretical Computer Science, 12(1--2):1--274, 2016. Google ScholarDigital Library
- Z. Zhao and Z. Feng. A spectral graph sparsification approach to scalable vector-less power grid integrity verification. In Proceedings of the 54th Annual Design Automation Conference 2017, page 68. ACM, 2017. Google ScholarDigital Library
- Z. Zhao, Y. Wang, and Z. Feng. Nearly-linear time spectral graph reduction for scalable graph partitioning and data visualization. arXiv preprint arXiv:1812.08942.Google Scholar
- Z. Zhao, Y. Wang, and Z. Feng. SAMG: Sparsified graph theoretic algebraic multigrid for solving large symmetric diagonally dominant (SDD) matrices. In Proceedings of ACM/IEEE International Conference on Computer-Aided Design, pages 601--606, 2017. Google ScholarDigital Library
- Effective-Resistance Preserving Spectral Reduction of Graphs
Recommendations
Effective Resistance Preserving Directed Graph Symmetrization
This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective resistance, is ...
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs
The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs of maximum degree at most three (also called subcubic graphs). In this paper, we will study its complexity in subclasses of subcubic graphs.Let S i , j , k be the graph ...
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer ScienceSpectral partitioning methods use the Fiedler vector-the eigenvector of the second-smallest eigenvalue of the Laplacian matrix-to find a small separator of a graph. These methods are important components of many scientific numerical algorithms and have ...
Comments