在近似线性时间内找到大小为\sqrt{N/e}的隐藏集团
Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time
摘要:
考虑一个Erdös-Renyi随机图,其中除了形成团(完全连通子图)的顶点子集$\sC_N$之外,每个边都以1/2的概率独立存在。我们考虑的问题,确定集团,实现这样一个随机图。最著名的算法可证明以高概率在线性时间内找到团,提供了$|\sC_N|\ge 1.261\sqrt{N}$ \cite{dekel2011finding}。光谱方法可以证明在小于$\sqrt{N}$的团上失败。在本文中,我们描述了一个近似线性的时间算法,成功的概率高$|\sC_N|\ge (1+\eps)\sqrt{N/e}$的任何$\eps>0$。这是第一个可证明优于谱方法的算法。我们进一步推广的隐藏团的问题,其他背景图(标准情况下,对应于$N$顶点上的完全图)。对于度为$(Δ+1)$的大围长正则图,我们证明了“局部”算法如果是$|\sC_N|\ge (1+\eps)N/\sqrt{eΔ}$则成功,如果是$|\sC_N|\le(1-\eps)N/\sqrt{eΔ}$则失败。
英文摘要:
Consider an Erdös-Renyi random graph in which each edge is present independently with probability 1/2, except for a subset $\sC_N$ of the vertices that form a clique (a completely connected subgraph). We consider the problem of identifying the clique, given a realization of such a random graph. The best known algorithm provably finds the clique in linear time with high probability, provided $|\sC_N|\ge 1.261\sqrt{N}$ \cite{dekel2011finding}. Spectral methods can be shown to fail on cliques smaller than $\sqrt{N}$. In this paper we describe a nearly linear time algorithm that succeeds with high probability for $|\sC_N|\ge (1+\eps)\sqrt{N/e}$ for any $\eps>0$. This is the first algorithm that provably improves over spectral methods. We further generalize the hidden clique problem to other background graphs (the standard case corresponding to the complete graph on $N$ vertices). For large girth regular graphs of degree $(Δ+1)$ we prove that `local' algorithms succeed if $|\sC_N|\ge (1+\eps)N/\sqrt{eΔ}$ and fail if $|\sC_N|\le(1-\eps)N/\sqrt{eΔ}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。