标号随机块模型的重构
Reconstruction in the Labeled Stochastic Block Model
摘要:
标记随机块模型是一种表示具有社团结构和多种类型交互的网络的随机图模型。在其最简单的形式中,它由两个大小近似相等的社区组成,并且根据其两个端点是否属于同一社区而随机绘制和标记边缘。在\cite{Heimlicher12}中已经证实,相关重建(即,标识与到底层社区的真实划分相关的划分)当且仅当模型参数超过阈值时才可行。我们证明了这个猜想的一半,即,当低于阈值时,重建是不可能的。在正方向上,我们引入了一个加权图来利用标签信息。通过适当选择权函数,我们表明,当超过阈值的一个特定的常数,重建是通过(1)最小二分法,(2)半定松弛的最小二分法,(3)光谱方法结合删除的边缘事件的顶点的高度。此外,我们表明,假设检验之间的标记随机块模型和标记Erdens-Rényi随机图模型表现出一个相变的重建阈值。
英文摘要:
The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two endpoints belong to the same community or not. It has been conjectured in \cite{Heimlicher12} that correlated reconstruction (i.e.\ identification of a partition correlated with the true partition into the underlying communities) would be feasible if and only if a model parameter exceeds a threshold. We prove one half of this conjecture, i.e., reconstruction is impossible when below the threshold. In the positive direction, we introduce a weighted graph to exploit the label information. With a suitable choice of weight function, we show that when above the threshold by a specific constant, reconstruction is achieved by (1) minimum bisection, (2) a semidefinite relaxation of minimum bisection, and (3) a spectral method combined with removal of edges incident to vertices of high degree. Furthermore, we show that hypothesis testing between the labeled stochastic block model and the labeled Erdős-Rényi random graph model exhibits a phase transition at the conjectured reconstruction threshold.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。