Spectral Sparsification of Random-Walk Matrix Polynomials
share
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial L_α(G)=D-∑_r=1^dα_rD(D^-1A)^r where A is the adjacency matrix of a weighted, undirected graph, D is the diagonal matrix of weighted degrees, and α=(α_1...α_d) are nonnegative coefficients with ∑_r=1^dα_r=1. Recall that D^-1A is the transition matrix of random walks on the graph. The sparsification of L_α(G) appears to be algorithmically challenging as the matrix power (D^-1A)^r is defined by all paths of length r, whose precise calculation would be prohibitively expensive. In this paper, we develop the first nearly linear time algorithm for this sparsification problem: For any G with n vertices and m edges, d coefficients α, and ϵ > 0, our algorithm runs in time O(d^2m^2n/ϵ^2) to construct a Laplacian matrix L̃=D-Ã with O(n n/ϵ^2) non-zeros such that L̃≈_ϵL_α(G). Matrix polynomials arise in mathematical analysis of matrix functions as well as numerical solutions of matrix equations. Our work is particularly motivated by the algorithmic problems for speeding up the classic Newton's method in applications such as computing the inverse square-root of the precision matrix of a Gaussian random field, as well as computing the qth-root transition (for q≥1) in a time-reversible Markov model. The key algorithmic step for both applications is the construction of a spectral sparsifier of a constant degree random-walk matrix-polynomials introduced by Newton's method. Our algorithm can also be used to build efficient data structures for effective resistances for multi-step time-reversible Markov models, and we anticipate that it could be useful for other tasks in network analysis.
READ FULL TEXT
