89 citations · 113 across the 11 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Graph reduction with spectral and cut guarantees
Andreas Loukas
Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral…
cs.LG2018
Spectrally approximating large graphs with smaller graphs
Andreas Loukas, Pierre Vandergheynst
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian ma…