具有重叠组的大规模网络模型的模型选择与假设检验
Model selection and hypothesis testing for large-scale network models with overlapping groups
摘要:
对网络系统越来越详细的理解,导致了从数据中提取其大尺度结构的各种方法。不幸的是,这些方法中的许多方法对同一网络产生了不同的描述,这使得比较和理解它们的结果成为一个困难的挑战。解决这个突出问题的一个可能的方法是将重点从特设方法转移到基于生成模型的统计推断的更有原则的方法。因此,我们面临的是在竞争生成过程之间进行选择的更明确的任务,这可以在统一的概率框架下完成。在这里,我们考虑各种生成模型之间的比较,包括度校正(其中具有任意度的节点可以属于同一个组)和社区重叠(其中允许节点属于多个组)等特征。由于这种模型变体拥有越来越多的参数,它们变得容易过拟合。在这项工作中,我们提出了一种基于最小描述长度标准和后验比值比的模型选择方法,该方法能够充分考虑较大模型的自由度增加,并根据数据中的统计证据选择最佳模型。在将这种方法应用于来自不同领域的许多经验未加权网络时,我们观察到社区重叠通常没有统计证据支持,并且仅被选为其中少数人的更好模型。另一方面,我们发现,度校正往往是几乎普遍青睐的可用数据,这意味着内在的节点属性(而不是组属性)往往是网络形成的一个重要组成部分。
英文摘要:
The effort to understand network systems in increasing detail has resulted in a diversity of methods designed to extract their large-scale structure from data. Unfortunately, many of these methods yield diverging descriptions of the same network, making both the comparison and understanding of their results a difficult challenge. A possible solution to this outstanding issue is to shift the focus away from ad hoc methods and move towards more principled approaches based on statistical inference of generative models. As a result, we face instead the more well-defined task of selecting between competing generative processes, which can be done under a unified probabilistic framework. Here, we consider the comparison between a variety of generative models including features such as degree correction, where nodes with arbitrary degrees can belong to the same group, and community overlap, where nodes are allowed to belong to more than one group. Because such model variants possess an increasing number of parameters, they become prone to overfitting. In this work, we present a method of model selection based on the minimum description length criterion and posterior odds ratios that is capable of fully accounting for the increased degrees of freedom of the larger models, and selects the best one according to the statistical evidence available in the data. In applying this method to many empirical unweighted networks from different fields, we observe that community overlap is very often not supported by statistical evidence and is selected as a better model only for a minority of them. On the other hand, we find that degree correction tends to be almost universally favored by the available data, implying that intrinsic node proprieties (as opposed to group properties) are often an essential ingredient of network formation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。