True scale-free networks
Naturally occurring networks have an underlying scale-free structure that is often clouded by finite-size effects in the sample data.
True scale-free networks hidden by finite size effects
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. Specifically, we analyze by finite-size scaling analysis the datasets of real networks to check whether the purported departures from power-law behavior are due to the finiteness of sample size. We find that a large number of the networks 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 involving infrastructure and transportation but also in social networks. We conclude that the 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.
More in Hidden communities
A new tool derived from information theory quantitatively identifies trees, hierarchies and community structures within complex networks.
An iterative version of a method to identify hierarchies and rankings of nodes in directed networks can partly overcome its resolution limit.
Inference from single snapshots of temporal networks can misleadingly group communities if the links between snapshots are correlated.
The spectral density of graph ensembles provides an exact solution to the graph partitioning problem and helps detect community structure.