Artico I, Smolyarenko I, Vinciotti V, Wit E C
Università della Svizzera italiana, Lugano, Switzerland.
Brunel University London, Uxbridge, UK.
Proc Math Phys Eng Sci. 2020 Sep;476(2241):20190742. doi: 10.1098/rspa.2019.0742. Epub 2020 Sep 16.
The putative scale-free nature of real-world networks has generated a lot of interest in the past 20 years: if networks from many different fields share a common structure, then perhaps this suggests some underlying 'network law'. Testing the degree distribution of networks for power-law tails has been a topic of considerable discussion. statistical methodology has been used both to discredit power-laws as well as to support them. This paper proposes a statistical testing procedure that considers the complex issues in testing degree distributions in networks that result from observing a finite network, having dependent degree sequences and suffering from insufficient power. We focus on testing whether the tail of the empirical degrees behaves like the tail of a de Solla Price model, a two-parameter power-law distribution. We modify the well-known Kolmogorov-Smirnov test to achieve even sensitivity along the tail, considering the dependence between the empirical degrees under the null distribution, while guaranteeing sufficient power of the test. We apply the method to many empirical degree distributions. Our results show that power-law network degree distributions are not rare, classifying almost 65% of the tested networks as having a power-law tail with at least 80% power.
在过去20年里,现实世界网络假定的无标度性质引发了人们的极大兴趣:如果来自许多不同领域的网络具有共同结构,那么这或许暗示着某种潜在的“网络法则”。检验网络度分布是否具有幂律尾部一直是一个备受讨论的话题。统计方法既被用于质疑幂律,也被用于支持幂律。本文提出了一种统计检验程序,该程序考虑了在检验网络度分布时因观测有限网络、度序列相关以及检验功效不足而产生的复杂问题。我们专注于检验经验度的尾部是否表现得像德索拉·普赖斯模型(一种双参数幂律分布)的尾部。我们对著名的柯尔莫哥洛夫-斯米尔诺夫检验进行了修改,以在尾部实现均匀的敏感性,同时考虑原假设分布下经验度之间的相关性,并且保证检验具有足够的功效。我们将该方法应用于许多经验度分布。我们的结果表明,幂律网络度分布并不罕见,将近65%的被测试网络被归类为具有至少80%功效的幂律尾部。