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

二元随机块模型中边信息的精确恢复

Side Information in the Binary Stochastic Block Model: Exact Recovery

Hussein Saad, Ahmed Abotabl, Aria Nosratinia

摘要:

在社区发现问题中,可以访问关于每个节点的标签的附加观察(边信息)。研究了具有$n$节点的二元对称随机块模型(SBM)中边信息的质量和数量对精确恢复相变的影响。当边信息由通过具有交叉概率$α$的二进制对称信道观察到的标签组成时,以及当交叉概率为$\log(\frac{1-α}α) =O(\log(n))$时,证明了边信息对相变有积极的影响,并刻画了在此条件下的新相变。当$α$为常数或足够缓慢地接近零时,即,$\log(\frac{1-α}α) = o(\log(n))$,它表明,边信息并不帮助准确的恢复。当边信息由通过具有参数$ε$的二进制擦除信道观察到的标签组成时,并且当$\log(ε)=O(\log(n))$时,示出边信息提高了精确恢复,并且表征了新的相变。如果是$\log(ε)=o(\log(n))$,则表明辅助信息没有帮助。然后将结果推广到有限基数的任意边信息。除了$M$ -ary边信息下的一种特殊情况外,本文还导出了精确恢复的充分必要条件。提出了一种有效的算法,结合边信息的影响,使用局部改进过程相结合的部分恢复算法。充分条件推导出精确恢复下,这种有效的算法。

英文摘要:

In the community detection problem, one may have access to additional observations (side information) about the label of each node. This paper studies the effect of the quality and quantity of side information on the phase transition of exact recovery in the binary symmetric stochastic block model (SBM) with $n$ nodes. When the side information consists of the label observed through a binary symmetric channel with crossover probability $α$, and when $\log(\frac{1-α}α) =O(\log(n))$, it is shown that side information has a positive effect on phase transition; the new phase transition under this condition is characterized. When $α$ is constant or approaches zero sufficiently slowly, i.e., $\log(\frac{1-α}α) = o(\log(n))$, it is shown that side information does not help exact recovery. When the side information consists of the label observed through a binary erasure channel with parameter $ε$, and when $\log(ε)=O(\log(n))$, it is shown that side information improves exact recovery and the new phase transition is characterized. If $\log(ε)=o(\log(n))$, then it is shown that side information is not helpful. The results are then generalized to an arbitrary side information of finite cardinality. Necessary and sufficient conditions are derived for exact recovery that are tight, except for one special case under $M$-ary side information. An efficient algorithm that incorporates the effect of side information is proposed that uses a partial recovery algorithm combined with a local improvement procedure. Sufficient conditions are derived for exact recovery under this efficient algorithm.

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

↑