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

Planted二分模型的相容性定理

Consistency Thresholds for the Planted Bisection Model

Elchanan Mossel, Joe Neeman, Allan Sly

摘要:

种植二分模型是一种随机图模型,其中节点被分成两个大小相等的社区,然后以依赖于社区成员的方式随机添加边。我们建立了该模型中种植二分法渐近可恢复的充要条件。当二分法是渐近可恢复的时,我们给出了一个有效的算法,成功地恢复了它。我们还证明了种植二分法是渐近可恢复的当且仅当高概率的每个节点属于同一社区的大多数邻居。我们的算法寻找种植平分运行的时间几乎线性的边缘数。它有三个阶段:谱聚类计算一个初始的猜测,一个“副本”阶段,以获得几乎每一个顶点正确,然后一些简单的局部移动来完成这项工作。阿贝、班德拉和霍尔的一项独立工作建立了类似的(稍弱的)结果,但仅限于对数平均度的情况。

英文摘要:

The planted bisection model is a random graph model in which the nodes are divided into two equal-sized communities and then edges are added randomly in a way that depends on the community membership. We establish necessary and sufficient conditions for the asymptotic recoverability of the planted bisection in this model. When the bisection is asymptotically recoverable, we give an efficient algorithm that successfully recovers it. We also show that the planted bisection is recoverable asymptotically if and only if with high probability every node belongs to the same community as the majority of its neighbors. Our algorithm for finding the planted bisection runs in time almost linear in the number of edges. It has three stages: spectral clustering to compute an initial guess, a "replica" stage to get almost every vertex correct, and then some simple local moves to finish the job. An independent work by Abbe, Bandeira, and Hall establishes similar (slightly weaker) results but only in the case of logarithmic average degree.

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

↑