Spectral Sparsification of Random-Walk Matrix Polynomials

CoRR, 2015.

Cited by: 4|Bibtex|Views21|Links
EI

Abstract:

We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial $L_\alpha(G)=D-\sum_{r=1}^d\alpha_rD(D^{-1}A)^r$ where $A$ is the adjacency matrix of a weighted, undirected graph, $D$ is the diagonal matrix of weighted degrees, and $\alpha=(\alpha_1...\alpha_d)$ a...More

Code:

Data:

Your rating :
0

 

Tags
Comments