arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.4813cs.SIcond-mat.stat-mechphysics.soc-ph
收藏

网络中核心-外围结构的识别

Identification of core-periphery structure in networks

Xiao Zhang, Travis Martin, M. E. J. Newman

摘要:

许多网络可以有效地分解为一个密集的核心加上一个外围的松散连接的外围。在这里,我们提出了一个算法,用于执行这样的分解经验网络数据,使用统计推断的方法。我们的方法适合生成模型的核心-外围结构观察到的数据使用的期望-最大化算法计算模型的参数和计算分解本身的信念传播算法的组合。我们发现该方法是有效的,很容易扩展到网络与一百万或更多的节点,我们测试它的一系列网络,包括现实世界的例子,以及计算机生成的基准,它成功地识别已知的核心外围结构低出错率。我们还证明了该方法是免疫的检测能力的过渡中观察到的相关社区发现问题,防止检测社区结构时,该结构太弱。核心-外围结构不存在这样的转变,尽管存在一些统计误差,但无论它多么弱,都是可以检测到的。

英文摘要:

Many networks can be usefully decomposed into a dense core plus an outlying, loosely-connected periphery. Here we propose an algorithm for performing such a decomposition on empirical network data using methods of statistical inference. Our method fits a generative model of core-periphery structure to observed data using a combination of an expectation--maximization algorithm for calculating the parameters of the model and a belief propagation algorithm for calculating the decomposition itself. We find the method to be efficient, scaling easily to networks with a million or more nodes and we test it on a range of networks, including real-world examples as well as computer-generated benchmarks, for which it successfully identifies known core-periphery structure with low error rate. We also demonstrate that the method is immune from the detectability transition observed in the related community detection problem, which prevents the detection of community structure when that structure is too weak. There is no such transition for core-periphery structure, which is detectable, albeit with some statistical error, no matter how weak it is.

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

↑