arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.06232cs.DS
收藏

有向欧拉图的更好稀疏化器

Better Sparsifiers for Directed Eulerian Graphs

Sushant Sachdeva, Anvith Thudi, Yibin Zhao

AI总结:

本文针对有向欧拉图的光谱稀疏化问题,提出了改进的构造方法,将边数从最优的 Ω(nε^{-2}log^4 n) 降低到 O(nε^{-2}log^2 n log^2 log n + nε^{-4/3}log^{8/3} n),并给出了更快的构造算法。

摘要:

有向欧拉图的光谱稀疏化是设计求解有向拉普拉斯线性系统快速算法的关键组成部分。有向拉普拉斯线性系统求解器是快速计算随机游走基本问题(如计算平稳分布、命中时间和通勤时间、个性化 PageRank 向量)的重要算法原语。虽然光谱稀疏化在无向图中已被充分理解,且已知对于每个图 G,存在具有 O(nε^{-2}) 条边的 (1+ε)-稀疏化器 [Batson-Spielman-Srivastava, STOC '09](这是最优的),但已知最好的欧拉稀疏化器构造需要 Ω(nε^{-2}log^4 n) 条边,并且基于短圈分解 [Chu et al., FOCS '18]。在本文中,我们给出了欧拉稀疏化器的改进构造,具体来说:1. 我们证明对于每个有向欧拉图 G,存在一个具有 O(nε^{-2} log^2 n log^2 log n + nε^{-4/3}log^{8/3} n) 条边的欧拉稀疏化器。该结果基于结合短圈分解 [Chu-Gao-Peng-Sachdeva-Sawlani-Wang, FOCS '18, SICOMP] 和 [Parter-Yogev, ICALP '19] 以及矩阵 Spencer 猜想的最新进展 [Bansal-Meka-Jiang, STOC '23]。2. 我们给出了基于短圈分解的构造的改进分析,为任何常数 δ>0 提供了一个 m^{1+δ} 时间的算法,用于构造具有 O(nε^{-2}log^3 n) 条边的欧拉稀疏化器。

英文摘要:

Spectral sparsification for directed Eulerian graphs is a key component in the design of fast algorithms for solving directed Laplacian linear systems. Directed Laplacian linear system solvers are crucial algorithmic primitives to fast computation of fundamental problems on random walks, such as computing stationary distribution, hitting and commute time, and personalized PageRank vectors. While spectral sparsification is well understood for undirected graphs and it is known that for every graph $G,$ $(1+\varepsilon)$-sparsifiers with $O(n\varepsilon^{-2})$ edges exist [Batson-Spielman-Srivastava, STOC '09] (which is optimal), the best known constructions of Eulerian sparsifiers require $Ω(n\varepsilon^{-2}\log^4 n)$ edges and are based on short-cycle decompositions [Chu et al., FOCS '18]. In this paper, we give improved constructions of Eulerian sparsifiers, specifically: 1. We show that for every directed Eulerian graph $\vec{G},$ there exist an Eulerian sparsifier with $O(n\varepsilon^{-2} \log^2 n \log^2\log n + n\varepsilon^{-4/3}\log^{8/3} n)$ edges. This result is based on combining short-cycle decompositions [Chu-Gao-Peng-Sachdeva-Sawlani-Wang, FOCS '18, SICOMP] and [Parter-Yogev, ICALP '19], with recent progress on the matrix Spencer conjecture [Bansal-Meka-Jiang, STOC '23]. 2. We give an improved analysis of the constructions based on short-cycle decompositions, giving an $m^{1+δ}$-time algorithm for any constant $δ> 0$ for constructing Eulerian sparsifiers with $O(n\varepsilon^{-2}\log^3 n)$ edges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑