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

边信息在子图检测中的作用

The Power of Side-information in Subgraph Detection

INRIA(法国国家信息与自动化研究所)

Arun Kadavankandy, Konstantin Avrachenkov, Laura Cottatellucci, Rajesh Sundaresan

摘要:

在这项工作中,我们解决了隐藏的社区发现的问题。我们认为置信传播(BP)应用于检测嵌入在更大和更稀疏的ER图中的隐藏的Erdens-Rényi(ER)图的问题,在边信息的存在下。我们推导了两个相关的算法,基于BP进行子图检测存在两种边信息。边信息的第一种变体由一组节点组成,称为线索,已知来自子图。边信息的第二种变体由一组节点组成,这些节点是具有给定概率的线索。过去的研究表明,当有效信噪比(SNR)参数低于阈值时,不带边信息的BP算法不能正确检测子图。相反,在存在非平凡的边信息,我们表明,BP算法实现了渐近零误差的SNR参数的任何值。我们通过对合成数据集和一些真实网络的模拟来验证我们的结果。

英文摘要:

In this work, we tackle the problem of hidden community detection. We consider Belief Propagation (BP) applied to the problem of detecting a hidden Erdős-Rényi (ER) graph embedded in a larger and sparser ER graph, in the presence of side-information. We derive two related algorithms based on BP to perform subgraph detection in the presence of two kinds of side-information. The first variant of side-information consists of a set of nodes, called cues, known to be from the subgraph. The second variant of side-information consists of a set of nodes that are cues with a given probability. It was shown in past works that BP without side-information fails to detect the subgraph correctly when an effective signal-to-noise ratio (SNR) parameter falls below a threshold. In contrast, in the presence of non-trivial side-information, we show that the BP algorithm achieves asymptotically zero error for any value of the SNR parameter. We validate our results through simulations on synthetic datasets as well as on a few real world networks.

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

↑