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

一类社区发现生成模型的精确恢复

Exact Recovery for a Family of Community-Detection Generative Models

Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann

摘要:

具有社区的网络的生成模型已经被广泛研究,因为它是建立信息理论和计算阈值的肥沃土壤。在本文中,我们提出了一个新的玩具模型种植生成模型称为种植随机能量模型(REM),德里达的REM的启发。对于这个模型,我们提供的最大似然估计的误差概率的渐近行为,因此准确的恢复阈值。作为应用,我们进一步考虑了$h$ -一致超图上的2个非等长社团加权随机块模型(2-WSBM),它等价于谱两边的P-REM,对于$h$的高边基数和低边基数.我们为任何$h$的精确可恢复性提供了上限和下限,将这些问题映射到上述P-REM。据我们所知,这些是第一个一致性结果的2-WSBM图和超图与非等大小的社区。

英文摘要:

Generative models for networks with communities have been studied extensively for being a fertile ground to establish information-theoretic and computational thresholds. In this paper we propose a new toy model for planted generative models called planted Random Energy Model (REM), inspired by Derrida's REM. For this model we provide the asymptotic behaviour of the probability of error for the maximum likelihood estimator and hence the exact recovery threshold. As an application, we further consider the 2 non-equally sized community Weighted Stochastic Block Model (2-WSBM) on $h$-uniform hypergraphs, that is equivalent to the P-REM on both sides of the spectrum, for high and low edge cardinality $h$. We provide upper and lower bounds for the exact recoverability for any $h$, mapping these problems to the aforementioned P-REM. To the best of our knowledge these are the first consistency results for the 2-WSBM on graphs and on hypergraphs with non-equally sized community.

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

↑