Scale-free Networks Well Done
ORAL
Abstract
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real networks. We first provide rigorous definitions of scale-free and power-law distributions, the latter equivalent to the definition of regularly varying distributions in statistics. These definitions allow the distribution to deviate from a pure power law arbitrarily but without affecting the power-law tail exponent. We then identify three estimators of these exponents that are proven to be statistically consistent - that is, converging to the true exponent value for any regularly varying distribution - and that satisfy some additional niceness requirements. Finally, we apply these estimators to a representative collection of synthetic and real data to find that real scale-free networks are definitely not as rare as one would conclude based on the popular but unrealistic assumption that real data comes from power laws of pristine purity, void of noise and deviations.
*This work was supported by NSF Grant No. IIS-1741355, ARO Grants No. W911NF-16-1-0391 and No. W911NF-17-1-0491, NWO VICI Grant No. 639.033.806, and the Gravitation Networks Grant No. 024.002.003.
–
Presenters
-
Ivan Voitalov
- Department of Physics and Network Science Institute, Northeastern University