arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.18429cs.DS
收藏

超稀疏随机图中独立集的平方和下界

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs

Pravesh Kothari, Aaron Potechin, Jeff Xu

AI总结:

本文针对超稀疏随机图首次证明了大于4度的Sum-of-Squares松弛下界,提出了一种精确估计图矩阵谱范数的新方法,填补了该领域的重要空白。

摘要:

我们证明,对于每个 $D \in \N$ 以及足够大的常数 $d \in \N$,在 $G \sim G(n,d/n)$(即 \Erdos-\Renyi 随机图分布)的选择上以高概率成立,标准的 $2D$ 度 Sum-of-Squares 松弛无法证明 $G$ 中最大独立集的规模为 $o(\frac{n}{\sqrt{d} D^4})$。具体而言,$D$ 度 Sum-of-Squares 加强最多只能将经典 \Lovasz theta SDP 松弛的整数间隙减小 $O(D^4)$ 倍。这是针对超稀疏随机图(即绝对常数平均度)上任何问题的 $>4$ 度 Sum-of-Squares (SoS) 松弛的首个下界。此类超稀疏图是先前方法的已知障碍,并被明确指出为一个主要开放方向(例如,~\cite{deshpande2019threshold, kothari2021stressfree})。事实上,超稀疏随机图上 SoS 下界的唯一其他示例是 Max-Cut 的 4 度下界。我们的主要技术成果是一种获取图矩阵($G(n,d/n)$ 中一类低度矩阵值多项式)谱范数估计的新方法,其精度在绝对常数因子内。所有先前的工作都会损失 $\poly log n$ 因子,这使得 $o(\log n)$ 度随机图上的任何下界变得微不足道。我们将这些新界与用于分析由伪校准构建的下界见证的机制的一些升级相结合,使得我们的分析不会丢失任何会使结果变得微不足道的 $ω(1)$ 因子。除了其他 SoS 下界外,我们相信建立图矩阵谱范数估计的方法将有助于分析平均情况输入下的数值算法。

英文摘要:

We prove that for every $D \in \N$, and large enough constant $d \in \N$, with high probability over the choice of $G \sim G(n,d/n)$, the \Erdos-\Renyi random graph distribution, the canonical degree $2D$ Sum-of-Squares relaxation fails to certify that the largest independent set in $G$ is of size $o(\frac{n}{\sqrt{d} D^4})$. In particular, degree $D$ sum-of-squares strengthening can reduce the integrality gap of the classical \Lovasz theta SDP relaxation by at most a $O(D^4)$ factor. This is the first lower bound for $>4$-degree Sum-of-Squares (SoS) relaxation for any problems on \emph{ultra sparse} random graphs (i.e. average degree of an absolute constant). Such ultra-sparse graphs were a known barrier for previous methods and explicitly identified as a major open direction (e.g.,~\cite{deshpande2019threshold, kothari2021stressfree}). Indeed, the only other example of an SoS lower bound on ultra-sparse random graphs was a degree-4 lower bound for Max-Cut. Our main technical result is a new method to obtain spectral norm estimates on graph matrices (a class of low-degree matrix-valued polynomials in $G(n,d/n)$) that are accurate to within an absolute constant factor. All prior works lose $\poly log n$ factors that trivialize any lower bound on $o(\log n)$-degree random graphs. We combine these new bounds with several upgrades on the machinery for analyzing lower-bound witnesses constructed by pseudo-calibration so that our analysis does not lose any $ω(1)$-factors that would trivialize our results. In addition to other SoS lower bounds, we believe that our methods for establishing spectral norm estimates on graph matrices will be useful in the analyses of numerical algorithms on average-case inputs.

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

↑