How rare are power-law networks really?

Author:

Artico I.1,Smolyarenko I.2ORCID,Vinciotti V.2,Wit E. C.1ORCID

Affiliation:

1. Università della Svizzera italiana, Lugano, Switzerland

2. Brunel University London, Uxbridge, UK

Abstract

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. Ad hoc 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.

Funder

European Cooperation in Science and Technology

Publisher

The Royal Society

Subject

General Physics and Astronomy,General Engineering,General Mathematics

Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Degree distributions in networks: Beyond the power law;Statistica Neerlandica;2024-07-23

2. Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs;SIAM Journal on Discrete Mathematics;2024-06-25

3. Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning;Proceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy;2024-06-19

4. Emergence of inertia in the low-Reynolds regime of self-diffusiophoretic motion;Physical Review E;2024-05-08

5. Distinguishing subsampled power laws from other heavy-tailed distributions;Physical Review E;2024-05-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3