Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
arxiv(2024)
摘要
We consider the problem of estimating the spectral density of the normalized
adjacency matrix of an n-node undirected graph. We provide a randomized
algorithm that, with O(nϵ^-2) queries to a degree and neighbor
oracle and in O(nϵ^-3) time, estimates the spectrum up to ϵ
accuracy in the Wasserstein-1 metric. This improves on previous
state-of-the-art methods, including an O(nϵ^-7) time algorithm from
[Braverman et al., STOC 2022] and, for sufficiently small ϵ, a
2^O(ϵ^-1) time method from [Cohen-Steiner et al., KDD 2018]. To
achieve this result, we introduce a new notion of graph sparsification, which
we call nuclear sparsification. We provide an O(nϵ^-2)-query and
O(nϵ^-2)-time algorithm for computing O(nϵ^-2)-sparse
nuclear sparsifiers. We show that this bound is optimal in both its sparsity
and query complexity, and we separate our results from the related notion of
additive spectral sparsification. Of independent interest, we show that our
sparsification method also yields the first deterministic algorithm for
spectral density estimation that scales linearly with n (sublinear in the
representation size of the graph).
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要