Scale-free networks are rare

Abstract

A central claim in modern network science is that real-world networks are typically "scale free," meaning that the fraction of nodes with degree $k$ follows a power law, decaying like $k^{-\alpha }$, often with $2<\alpha <3$. However, empirical evidence for this belief derives from a relatively small number of real-world networks. We test the universality of scale-free structure by applying state-of-the-art statistical tools to a large corpus of nearly 1000 network data sets drawn from social, biological, technological, and informational sources. We fit the power-law model to each degree distribution, test its statistical plausibility, and compare it via a likelihood ratio test to alternative, non-scale-free models, e.g., the log-normal. Across domains, we find that scale-free networks are rare, with only 4% exhibiting the strongest-possible evidence of scale-free structure and 52% exhibiting the weakest-possible evidence. Furthermore, evidence of scale-free structure is not uniformly distributed across sources: social networks are at best weakly scale free, while a handful of technological and biological networks can be called strongly scale free. These results undermine the universality of scale-free networks and reveal that real-world networks exhibit a rich structural diversity that will likely require new ideas and mechanisms to explain.

14 pages, 9 figures, 2 tables, 5 appendices

References in corpus (6)

• Power-law distributions in empirical data
• Hierarchical structure and the prediction of missing links in networks
• Biological network comparison using graphlet degree distribution
• Universality of citation distributions: towards an objective measure of scientific impact
• Self-similarity of complex networks and hidden metric spaces
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules

Cited by in corpus (112)

• Robustness and resilience of complex networks
• Metrics for Graph Comparison: A Practitioner's Guide
• Statistical physics approaches to the complex Earth system
• Scale-free Networks Well Done
• Extreme events in dynamical systems and random walkers: A review
• The effectiveness of backward contact tracing in networks
• True scale-free networks hidden by finite size effects
• Predicting the Future of AI with AI: High-quality link prediction in an exponentially growing knowledge network
• Good and bad predictions: Assessing and improving the replication of chaotic attractors by means of reservoir computing
• Adversarial Attack on Community Detection by Hiding Individuals
• Multi-scale structural complexity of natural patterns
• Testing statistical laws in complex systems
• Government as Network Catalyst: Accelerating Self-Organization in a Strategic Industry
• Exponential random graph model parameter estimation for very large directed networks
• Satellite-based photonic quantum networks are small-world
• Cryptocurrencies Activity as a Complex Network: Analysis of Transactions Graphs
• Comparing Alternatives to the Fixed Degree Sequence Model for Extracting the Backbone of Bipartite Projections
• Percolation on feature-enriched interconnected systems
• Tackling the subsampling problem to infer collective properties from limited data
• Two Decades of Network Science as seen through the co-authorship network of network scientists
• A complex network approach to political analysis: application to the Brazilian Chamber of Deputies
• Heavy tails and pruning in programmable photonic circuits
• Fractal and multifractal descriptors restore ergodicity broken by non-Gaussianity in time series
• Diverse strategic identities induce dynamical states in evolutionary games
• Universal transient behavior in large dynamical systems on networks
• The nature and nurture of network evolution
• Searching for small-world and scale-free behaviour in long-term historical data of a real-world power grid
• The maximum capability of a topological feature in link prediction
• A comprehensive statistical study of metabolic and protein-protein interaction network properties
• Cooperation dynamics in the networked geometric Brownian motion
• Circulation of a digital community currency
• Simple bots breed social punishment in humans
• Investigating and Modeling the Dynamics of Long Ties
• Impact of perception models on friendship paradox and opinion formation
• Identifying time dependence in network growth
• Connecting complex networks to nonadditive entropies
• Long-tailed distributions of inter-event times as mixtures of exponential distributions
• Scale-Free Networks beyond Power-Law Degree Distribution
• Path-dependent connectivity, not modularity, consistently predicts controllability of structural brain networks
• Modeling the Impact of Social Distancing and Targeted Vaccination on the Spread of COVID-19 through a Real City-Scale Contact Network
• Precursor-driven machine learning prediction of chaotic extreme pulses in Kerr resonators
• Wave function network description and Kolmogorov complexity of quantum many-body systems
• Networks with many structural scales: a Renormalization Group perspective
• Effect of expanding learning scope on the evolution of cooperation in scale-free networks
• Solvable epidemic model on degree-correlated networks
• Multi-Temporal Analysis and Scaling Relations of 100,000,000,000 Network Packets
• Scale-free collaboration networks: An author name disambiguation perspective
• Scale-variant topological information for characterizing the structure of complex networks
• Boolean function metrics can assist modelers to check and choose logical rules
• Critical Phenomena and Strategy Ordering with Hub Centrality Approach in the Aspiration-based Coordination Game
• A Bird's-Eye View of Naming Game Dynamics: From Trait Competition to Bayesian Inference
• Uncovering hidden dependency in weighted networks via information entropy
• Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness
• Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
• Beyond Pairwise Interactions: Unveiling the Role of Higher-Order Interactions via Stepwise Reduction
• Control of excitable systems is optimal near criticality
• Power-law and log-normal avalanche size statistics in random growth processes
• Some Challenges in Monitoring Epidemics
• Exponential rate of epidemic spreading on complex networks
• Non-parametric power-law surrogates
• Random Processes with High Variance Produce Scale Free Networks
• Impact of random and targeted disruptions on information diffusion during outbreaks
• Detecting Hidden Layers from Spreading Dynamics on Complex Networks
• Explaining the emergence of complex networks through log-normal fitness in a Euclidean node similarity space
• Complexity in patterns of racial segregation
• Topology Analysis of the XRP Ledger
• Network Cards: concise, readable summaries of network data
• Practical Routing and Criticality in Large-Scale Quantum Communication Networks
• Learning the mechanisms of network growth
• Scaling Laws for Function Diversity and Specialization Across Socioeconomic and Biological Complex Systems
• On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
• War pact model of shrinking networks
• Scale-free networks may not necessarily witness cooperation
• A measure for characterizing heavy-tailed networks
• GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm
• Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
• Tunable robustness in power-law inference
• Generation of scale-free assortative networks via Newman rewiring for simulation of diffusion phenomena
• Stochastic resetting in a networked multiparticle system with correlated transitions
• Comparing directed networks via denoising graphlet distributions
• A graph complexity measure based on the spectral analysis of the Laplace operator
• A mutual information-based in vivo monitoring of adaptive response to targeted therapies in melanoma
• Degree distributions under general node removal: Power-law or Poisson?
• Copula-based analysis of the generalized friendship paradox in clustered networks
• Trust based attachment
• How a minority can win: Undemocratic outcomes in a simple model of voter turnout
• Income distribution in Thailand is scale-invariant
• Epidemic risk perception and social interactions lead to awareness cascades on multiplex networks
• Systematic comparison of graph embedding methods in practical tasks
• Heavy-Tailed Distribution of the Number of Papers within Scientific Journals
• Far-reaching consequences of trait preferences for animal social network structure and function
• Simulation of Stance Perturbations
• Analytical approach to the generalized friendship paradox in networks with correlated attributes
• The hidden architecture of connections: How do multidimensional identities shape our social networks?
• Long-range connections, real-world networks and rates of diffusion
• Understanding How Network Geometry Influences Diffusion Processes in Complex Networks: A Focus on Cryptocurrency Blockchains and Critical Infrastructure Networks
• Global hierarchy vs. local structure: spurious self-feedback in scale-free networks
• Empirically Classifying Network Mechanisms
• How network properties and epidemic parameters influence stochastic SIR dynamics on scale-free random networks
• A Compounded Burr Probability Distribution for Fitting Heavy-Tailed Data with Applications to Biological Networks
• Sharpest possible clustering bounds using robust random graph analysis
• Modified Lomax Model: A heavy-tailed distribution for fitting large-scale real-world complex networks
• Understanding following patterns among high-performance athletes
• Robust subgraph counting with distribution-free random graph analysis
• Exploring the space of graphs with fixed discrete curvatures
• Robustness of the Random Language Model
• Power law dynamics in genealogical graphs
• Distinguishing subsampled power laws from other heavy-tailed distributions
• Preferential attachment hypergraph with vertex deactivation
• Computing well-balanced spanning trees of unweighted networks
• SGC: A semi-supervised pipeline for gene clustering using self-training approach in gene co-expression networks
• Starvation suppression in dense scale-free metabolic networks: Dynamical mean-field analysis of catalytic reaction networks