True scale-free networks hidden by finite size effects

Abstract

We analyze about two hundred naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned on the basis of statistical testing of the validity of power law distributions of network degrees by contrasting real data. Specifically, we analyze by finite-size scaling analysis the datasets of real networks to check whether purported departures from the power law behavior are due to the finiteness of the sample size. In this case, power laws would be recovered in the case of progressively larger cutoffs induced by the size of the sample. We find that a large number of the networks studied follow a finite size scaling hypothesis without any self-tuning. This is the case of biological protein interaction networks, technological computer and hyperlink networks, and informational networks in general. Marked deviations appear in other cases, especially infrastructure and transportation but also social networks. We conclude that underlying scale invariance properties of many naturally occurring networks are extant features often clouded by finite-size effects due to the nature of the sample data.

References in corpus (29)

• Emergence of scaling in random networks
• Power-law distributions in empirical data
• The architecture of complex weighted networks
• Evolution of networks
• Self-similarity of complex networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Powerlaw: a Python package for analysis of heavy-tailed distributions
• Scale-free networks are rare
• Bose-Einstein condensation in complex networks
• The Anatomy of the Facebook Social Graph
• Popularity versus Similarity in Growing Networks
• Origins of fractality in the growth of complex networks
• Statistical properties of sampled networks
• The Statistical Physics of Real-World Networks
• Classification of scale-free networks
• Cut-offs and finite size effects in scale-free networks
• The Fractal Properties of Internet
• A Measure of data-collapse for scaling
• Scale-free Networks Well Done
• Temporal effects in the growth of networks
• Low-temperature behavior of two-dimensional Gaussian Ising spin glasses
• Finiteness and Fluctuations in Growing Networks
• Large-scale analysis of Zipf's law in English texts
• Multiscale unfolding of real networks by geometric renormalization
• Emergence of scale-free leadership structure in social recommender systems
• Testing statistical laws in complex systems
• Numerical Computation of Finite Size Scaling Functions: An Alternative Approach to Finite Size Scaling
• autoScale.py - A program for automatic finite-size scaling analyses: A user's guide
• Exact derivation of a finite-size-scaling law and corrections to scaling in the geometric Galton-Watson process

Cited by in corpus (24)

• Robustness and resilience of complex networks
• Laplacian Renormalization Group for heterogeneous networks
• Tackling the subsampling problem to infer collective properties from limited data
• The nature and nurture of network evolution
• Meta-validation of bipartite network projections
• Separating Polarization from Noise: Comparison and Normalization of Structural Polarization Measures
• Circulation of a digital community currency
• The emergence of scale-free fires in Australia
• Scale-Free Networks beyond Power-Law Degree Distribution
• Bursty Switching Dynamics Promotes the Collapse of Network Topologies
• Wave function network description and Kolmogorov complexity of quantum many-body systems
• Networks with many structural scales: a Renormalization Group perspective
• Network Renormalization
• Finite-size scaling of geometric renormalization flows in complex networks
• Non-parametric power-law surrogates
• Laplacian Renormalization Group: An introduction to heterogeneous coarse-graining
• Scaling properties of scale-free networks in degree-thresholding renormalization flows
• Strange Attractors in Complex Networks
• Node differentiation dynamics along the route to synchronization in complex networks
• Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
• Degree distributions under general node removal: Power-law or Poisson?
• Distinguishing subsampled power laws from other heavy-tailed distributions
• Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
• Nonparametric estimation of the preferential attachment function from one network snapshot