64 citations · 149 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 10 cited
Spectral Sparsification of Random-Walk Matrix Polynomials
Dehua Cheng, Yu Cheng, Yan Liu +2
We consider a fundamental algorithmic question in spectral graph theory: Compute a spectral sparsifier of random-walk matrix-polynomial whe…
cs.DS2014★ 5 cited
Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models
Dehua Cheng, Yu Cheng, Yan Liu +2
Motivated by a sampling problem basic to computational statistical inference, we develop a nearly optimal algorithm for a fundamental problem in spectral graph theory and numerical…