School of Economics and Management, Jiangsu University of Science and Technology, Zhenjiang 212003, China.
Center for Polymer Studies, Boston University, Boston, MA 02215.
Proc Natl Acad Sci U S A. 2020 Jun 30;117(26):14812-14818. doi: 10.1073/pnas.1918901117. Epub 2020 Jun 15.
Whether real-world complex networks are scale free or not has long been controversial. Recently, in Broido and Clauset [A. D. Broido, A. Clauset, 10, 1017 (2019)], it was claimed that the degree distributions of real-world networks are rarely power law under statistical tests. Here, we attempt to address this issue by defining a fundamental property possessed by each link, the degree-degree distance, the distribution of which also shows signs of being power law by our empirical study. Surprisingly, although full-range statistical tests show that degree distributions are not often power law in real-world networks, we find that in more than half of the cases the degree-degree distance distributions can still be described by power laws. To explain these findings, we introduce a bidirectional preferential selection model where the link configuration is a randomly weighted, two-way selection process. The model does not always produce solid power-law distributions but predicts that the degree-degree distance distribution exhibits stronger power-law behavior than the degree distribution of a finite-size network, especially when the network is dense. We test the strength of our model and its predictive power by examining how real-world networks evolve into an overly dense stage and how the corresponding distributions change. We propose that being scale free is a property of a complex network that should be determined by its underlying mechanism (e.g., preferential attachment) rather than by apparent distribution statistics of finite size. We thus conclude that the degree-degree distance distribution better represents the scale-free property of a complex network.
现实世界中的复杂网络是否具有无标度特性一直存在争议。最近,在 Broido 和 Clauset [A. D. Broido, A. Clauset, 10, 1017 (2019)]的研究中,声称通过统计检验,现实世界网络的度分布很少是幂律分布。在这里,我们通过定义每个链路都具有的基本属性,即度-度距离,来尝试解决这个问题。我们的实证研究表明,度-度距离的分布也呈现出幂律分布的特征。令人惊讶的是,尽管全面的统计检验表明现实世界网络中的度分布通常不是幂律分布,但我们发现,在超过一半的情况下,度-度距离分布仍然可以用幂律来描述。为了解释这些发现,我们引入了一个双向优先选择模型,其中链路的配置是一个随机加权的双向选择过程。该模型并不总是产生稳定的幂律分布,但预测度-度距离分布比有限大小网络的度分布表现出更强的幂律行为,特别是在网络密集时。我们通过检验现实网络如何演变成过度密集的阶段以及相应的分布如何变化,来测试我们模型的强度及其预测能力。我们提出,无标度性是复杂网络的一种属性,应该由其底层机制(例如优先连接)决定,而不是由有限大小的明显分布统计决定。因此,我们得出结论,度-度距离分布更好地代表了复杂网络的无标度特性。