Before revision:  As an application, we develop an O(n /\text{poly \epsilon)) time algorithm for computing the spectral density of any n\times n normalized graph adjacency or Laplacian matrix.
After revision:  As an application, we develop an O(n \cdot \text{poly \epsilon)) time algorithm for computing the spectral density of any n\times n normalized graph adjacency or Laplacian matrix.