arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.04320math.PRcs.DS
收藏

k部图模型中社区检测的精确恢复

Exact Recovery of Community Detection in k-partite Graph Models

Zhongyang Li

摘要:

研究了顶点位于$k\ (k\geq 2)$不同社区中的图的顶点分类问题,边只允许在不同社区之间存在,并且不同社区中的顶点数不一定相等.观测值是一个加权的邻接矩阵,由高斯正交包络(GOE)或高斯酉包络(GUE)矩阵的标量倍数扰动。对于不同加权邻接矩阵的极大似然估计的精确恢复,我们证明了高斯扰动强度$σ$的锐阈值。这些加权邻接矩阵可以被认为是电网络的自然模型。令人惊讶的是,$σ$的这些阈值不依赖于MLE的样本空间是否被限制为每个组中的顶点的数量等于真值的分类。与$\ZZ_2$同步相比,本文设计了一种新的复半定规划(SDP)算法来有效地解决$k$大于2时的社团检测问题,并得到了一个$σ$的公共区域(与$k$无关),使得SDP能够准确地恢复真实分类.

英文摘要:

We study the vertex classification problem on a graph whose vertices are in $k\ (k\geq 2)$ different communities, edges are only allowed between distinct communities, and the number of vertices in different communities are not necessarily equal. The observation is a weighted adjacency matrix, perturbed by a scalar multiple of the Gaussian Orthogonal Ensemble (GOE), or Gaussian Unitary Ensemble (GUE) matrix. For the exact recovery of the maximum likelihood estimation (MLE) with various weighted adjacency matrices, we prove sharp thresholds of the intensity $σ$ of the Gaussian perturbation. These weighted adjacency matrices may be considered as natural models for the electric network. Surprisingly, these thresholds of $σ$ do not depend on whether the sample space for MLE is restricted to such classifications that the number of vertices in each group is equal to the true value. In contrast to the $\ZZ_2$-synchronization, a new complex version of the semi-definite programming (SDP) is designed to efficiently implement the community detection problem when the number of communities $k$ is greater than 2, and a common region (independent of $k$) for $σ$ such that SDP exactly recovers the true classification is obtained.

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

↑