arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.13135math.STcs.ITcs.LGeess.SPmath.ITstat.MLstat.TH
收藏

基于粗测量的图社区检测:粗加权随机块模型的恢复条件

Graph Community Detection from Coarse Measurements: Recovery Conditions for the Coarsened Weighted Stochastic Block Model

University of Toronto(多伦多大学);Vector Institute(向量研究院);Arizona State University(亚利桑那州立大学)

Nafiseh Ghoroghchian, Gautam Dasarathy, Stark C. Draper

摘要:

我们研究的问题,社区恢复从粗测量的图。与完全观察到的图的社区恢复问题相反,人们经常遇到在低分辨率下进行图的测量时的情况,每个测量跨多个图节点集成。这种低分辨率的测量有效地诱导了一个粗糙的图,它有自己的社区。我们的目标是开发条件图的结构,数量和测量的属性,在此条件下,我们可以恢复社区组织在这个粗糙的图。在本文中,我们建立在随机块模型的数学形式化的粗化过程,并表征其对社区成员和连接的影响。通过这种新的设置和建模,我们表征了社区恢复的误差界。的误差界产生简单和封闭形式的渐近条件,以实现完美的粗图社区的恢复。

英文摘要:

We study the problem of community recovery from coarse measurements of a graph. In contrast to the problem of community recovery of a fully observed graph, one often encounters situations when measurements of a graph are made at low-resolution, each measurement integrating across multiple graph nodes. Such low-resolution measurements effectively induce a coarse graph with its own communities. Our objective is to develop conditions on the graph structure, the quantity, and properties of measurements, under which we can recover the community organization in this coarse graph. In this paper, we build on the stochastic block model by mathematically formalizing the coarsening process, and characterizing its impact on the community members and connections. Through this novel setup and modeling, we characterize an error bound for community recovery. The error bound yields simple and closed-form asymptotic conditions to achieve the perfect recovery of the coarse graph communities.

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

↑