arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.4891math.OC
收藏

利用凸松弛保证恢复种植团和稠密子图

Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation

Brendan P. W. Ames

摘要:

本文研究了给定图中任意k结点子图的判定问题。我们把这个问题写为秩约束基数最小化的一个实例,然后使用核和11范数放松。虽然原来的组合问题是NP-困难的,我们证明了denominik-子图可以从我们的凸松弛的解决方案,某些程序的输入。特别是,我们建立准确的恢复的情况下,输入图包含一个单一的种植集团加噪声的形式损坏的邻接关系。我们考虑这种噪声的两种构造。在第一种情况下,噪声是由对手确定性地删除种植集团内的边缘,并放置转移边缘。在第二种情况下,随机执行这些边缘损坏。在二部图中,也建立了类似的恢复保证确定的denominant子图的固定大小,和随机生成的图的数值模拟的结果,包括证明我们的算法的有效性。

英文摘要:

We consider the problem of identifying the densest k-node subgraph in a given graph. We write this problem as an instance of rank-constrained cardinality minimization and then relax using the nuclear and 11 norms. Although the original combinatorial problem is NP-hard, we show that the densest k-subgraph can be recovered from the solution of our convex relaxation for certain program inputs. In particular, we establish exact recovery in the case that the input graph contains a single planted clique plus noise in the form of corrupted adjacency relationships. We consider two constructions for this noise. In the first, noise is introduced by an adversary deterministically deleting edges within the planted clique and placing diversionary edges. In the second, these edge corruptions are performed at random. Analogous recovery guarantees for identifying the densest subgraph of fixed size in a bipartite graph are also established, and results of numerical simulations for randomly generated graphs are included to demonstrate the efficacy of our algorithm.

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

↑