Abstract
Realworld networks are often claimed to be scale free, meaning that the fraction of nodes with degree k follows a power law k^{−α}, a pattern with broad implications for the structure and dynamics of complex systems. However, the universality of scalefree networks remains controversial. Here, we organize different definitions of scalefree networks and construct a severe test of their empirical prevalence using stateoftheart statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks. Across these networks, we find robust evidence that strongly scalefree structure is empirically rare, while for most networks, lognormal distributions fit the data as well or better than power laws. Furthermore, social networks are at best weakly scale free, while a handful of technological and biological networks appear strongly scale free. These findings highlight the structural diversity of realworld networks and the need for new theoretical explanations of these nonscalefree patterns.
Introduction
Networks are a powerful way to represent and study the structure of complex systems. Examples today are plentiful and include social interactions among individuals, protein or gene interactions in biological organisms, communication between digital computers, and various transportation systems. Across scientific domains and classes of networks, it is common to encounter the claim that most or all realworld networks are scale free. The precise details of this claim vary^{1,2,3,4,5,6,7}, but generally a network is deemed scale free if the fraction of nodes with degree k follows a powerlaw distribution k^{−α}, where α > 1. Some versions of this “scalefree hypothesis” have stronger requirements, e.g., requiring 2 < α < 3 or that node degrees evolve by the preferential attachment mechanism^{8,9}. Other versions make them weaker, e.g., the power law need only hold in the upper tail^{10}, it can exhibit an exponential cutoff^{11}, or it is merely more plausible than a thintailed distribution like an exponential or normal^{12}.
The study and use of scalefree networks is widespread throughout network science^{1,9,13,14,15}. Many studies investigate how the presence of scalefree structure shapes dynamics running over a network^{6,7,14,16,17,18,19,20,21,22}. For example, under the Kuramoto oscillator model, a transition to global synchronization is wellknown to occur at a precise threshold K_{c}, whose value depends on the powerlaw parameter α of the degree distribution^{23,24,25,26,27}. Scalefree networks are also widely used as a substrate for networkbased numerical simulations and experiments, and the study of specific generating mechanisms for scalefree networks has been framed as providing a common basis for understanding all network assembly^{3,8,9,28,29,30,31,32}.
The universality of scalefree networks, however, remains controversial. Many studies find support for their ubiquity^{4,5,16,17,33,34,35}, while others challenge it on statistical or theoretical grounds^{2,3,10,36,37,38,39,40,41,42,43,44}. This conflict in perspective has persisted because past work has typically relied upon small, often domainspecific data sets, less rigorous statistical methods, differing definitions of “scalefree” structure, and unclear standards of what counts as evidence for or against the scalefree hypothesis^{4,5,6,7,16,17,45,46,47,48}. Additionally, few studies have performed statistically rigorous comparisons of fitted powerlaw distributions to alternative, nonscalefree distributions, e.g., the lognormal or stretched exponential, which can imitate a powerlaw form in realistic sample sizes^{49}. These issues raise a natural question of the pervasiveness of strong empirical evidence for scalefree structures in realworld networks.
Central to this debate are the ambiguities induced by the diversity of uses of the term “scalefree network.” The classic definition^{1,21,35,37} states that a network is scale free if its degree distribution Pr(k) has a power law k^{−α} form. A power law is the only normalizable density function f(k) for node degrees in a network that is invariant under rescaling, i.e., \(f(c\;k) = g(c)f(k)\) for any constant c^{14}, and thus “free” of a natural scale. For a network’s degree distribution, being scale free implies a powerlaw pattern, and vice versa. Scale invariance can also refer to nondegreebased aspects of network structure, e.g., its subgraphs may be structurally selfsimilar^{50,51}, and sometimes these networks are also called scale free.
Scalefree networks are commonly discussed in the literature on network assembly mechanisms, particularly in the context of preferential attachment^{1,28,29}, in which the probability that a node gains a connection is proportional to its current degree k. Although preferential attachment is the most famous mechanism that produces scalefree networks, there exist other mechanisms that can also produce them^{13,14,15}. And, some variations of preferential attachment do not produce powerlaw degree distributions^{35}, although those networks are still sometimes, confusingly, called scale free. Because the shape of a degree distribution imposes only modest constraints on overall network structure^{52}, it represents relatively weak evidence when trying to distinguish generating mechanisms^{53,54,55,56}, even when the distribution’s functional form is clear. However, identifying that form from empirical data can be nontrivial, e.g., because lognormals often fit degree distributions as well or better than power laws^{49,56,57}.
Across this broad literature, the term “scalefree network” may mean a precise or approximate statistical pattern in the degree distribution, an emergent behavior in an asymptotic limit, or a property of all networks assembled in part or in whole by a particular family of mechanisms. This imprecision has contributed to the controversy around the scalefree hypothesis.
Here, we focus narrowly on the traditional degreebased definition of a scalefree network, which has the advantage of being directly testable using empirical data. Even within this scope, the definition is often modified by introducing auxiliary hypotheses^{58}. For instance, the scalefree pattern may only hold for the largest degrees, implying Pr(k) ∝ k^{−α} for k ≥ k_{min} > 1, so that the power law governs the distribution’s upper tail, while the lower tail or “body” follows some nonpowerlaw pattern. In other settings, finitesize effects may suppress the frequency of nodes with degrees close to the underlying system’s size, implying Pr(k) ∝ k^{−α}e^{−λk}, where λ governs the transition between a power law and an exponential cutoff in the extreme upper tail. Or, extreme heterogeneity among degrees may be of primary interest, implying a restriction like 2 < α < 3, where the distribution’s mean is finite while its variance is infinite, asymptotically. Finally, the power law may not even be meant to be a good model of the data itself, but rather simply a better model than some alternatives, e.g., an exponential or lognormal distribution, or just a generic standin for a “heavytailed” distribution, i.e., one that decays more slowly than an exponential.
A consequence of these varied uses of the term scalefree network is that different researchers can use the same term to refer to slightly different concepts, and this ambiguity complicates efforts to empirically evaluate the basic hypothesis. Here, we construct a severe test^{58} of the ubiquity of scalefree networks by applying stateoftheart statistical methods to a large and diverse corpus of realworld networks. To explicitly cover the variations in how scalefree networks have been defined in the literature, we formalize a set of quantitative criteria that represent differing strengths and types of evidence for scalefree structure in a particular network. This set of criteria unifies the common variations, and their combinations, and allows us to assess different types and degrees of evidence of scalefree degree distributions. For each network data set in the corpus, we estimate the bestfitting powerlaw model, test its statistical plausibility, and compare it to alternative nonscalefree distributions. We analyze these results collectively, consider how the evidence for scalefree structure varies across domains, and quantitatively evaluate their robustness under several alternative criteria. We conclude with a forwardlooking discussion of the empirical relevance of the scalefree hypothesis and offer suggestions for future research on the structure of networks.
Results
Preliminaries
A key component of our evaluation of the scalefree hypothesis is the use of a large and diverse corpus of realworld networks. This corpus is composed of 928 network data sets drawn from the Index of Complex Networks (ICON), a comprehensive online index of researchquality network data, spanning all fields of science^{59}. It includes networks from biological, information, social, technological, and transportation domains that range in size from hundreds to millions of nodes (Fig. 1). These networks also exhibit a wide variety of graph properties, such as being simple, directed, weighted, multiplex, temporal, or bipartite.
The scalefree hypothesis is defined most clearly for simple graphs, which have only one degree distribution. More complicated networks, e.g., a directed, weighted, multiplex network, can have multiple degree distributions, which complicates testing whether it is scale free; we must determine which degree distributions count as evidence and which do not. We address this problem in two ways. First, we apply a sequence of graph transformations that convert a given network data set, defined as a network with multiple graph properties, into a set of simple graphs, each of which can be tested unambiguously for scalefree structure (Supplementary Figs. 1 and 2). In this process, we discard any resulting simple graph that is either too dense or too sparse, under prespecified thresholds, to be plausibly scale free. (See Supplementary Note 1 for complete details.)
Then, for each simple graph associated with a network data set, we apply standard statistical methods^{49} to identify the bestfitting power law in the degree distribution’s upper tail, evaluate its statistical plausibility using a goodnessoffit test, and compare it to four alternative distributions fitted to the same part of the upper tail using a likelihoodratio test. The outputs of these fitting, testing, and comparison procedures for a given simple graph encode in a vector the statistical evidence for its scalefree structure. We then evaluate the set of these vectors for a given network data set under criteria that formalize the different definitions of a scalefree network.
For a given degree distribution, a key step in this process is the selection of a value k_{min}, above which the degrees are most closely modeled by a scalefree distribution (see Methods). Hence, the fitting procedure truncates nonpowerlaw behavior among lowdegree nodes, enabling a more clear evaluation of potentially scalefree patterns in the upper tail. For technical reasons, all model tests and comparisons must then be made only on the degrees k ≥ k_{min} in the upper tail^{49}. Although our primary evaluation uses a normalized likelihood ratio test^{60} that has been specifically shown valid for comparing the distributions considered here^{49}, we also present results based on using standard information criteria to compare distributional models^{61}.
This approach for evaluating evidence for scalefree structure has several advantages. It provides a systematic procedure applicable to any network data set, and treats every data set equivalently. It provides an evaluation of the scalefree hypothesis over a maximally broad variety of networks, which facilitates the characterization of their empirical ubiquity. And, it provides a means to assess different kinds of evidence for scalefree structure, by combining results from multiple degree distributions, if available in a network data set. The graphsimplification process or the particular evidence criteria used may also introduce biases into the results. We control for these possibilities by considering alternative criteria under multiple robustness analyses.
Definitions of a scalefree network
The different notions of evidence for scalefree structure found in the literature can be organized into a nearly nested set of categories (Fig. 2) and assessed by applying standard statistical tools to each graph associated with a network data set. Evidence for scalefree structure typically comes in two types: (i) a powerlaw distribution is not necessarily a good model of the degrees, but it is a relatively better model than alternatives, or (ii) a power law is itself a good model of the degrees.
The first type represents indirect evidence of scalefree structure, because the observed degree distribution is not itself required to be plausibly scale free, only that a scalefree pattern is more believable than some nonscalefree patterns. A network data set that exhibits this kind of evidence is placed into a category called

SuperWeak: For at least 50% of graphs, no alternative distribution is favored over the power law.
The second type represents direct evidence of scalefree structure, and the various modifications of a purely scalefree pattern can be organized in a set of nested categories that represent increasing levels of evidence:

Weakest: For at least 50% of graphs, a powerlaw distribution cannot be rejected (p ≥ 0.1).

Weak: Requirements of Weakest, and the powerlaw region contains at least 50 nodes (n_{tail} ≥ 50).

Strong: Requirements of Weak and SuperWeak, and \(2 \ < \ \hat \alpha \ < \ 3\) for at least 50% of graphs.

Strongest: Requirements of Strong for at least 90% of graphs, and requirements of SuperWeak for at least 95% of graphs.
The progression from Weakest to Strongest categories represents the addition of more specific properties of the powerlaw degree distribution, all found in the literature on scalefree networks or distributions. We define a sixth category of networks that includes all networks that do not fall into any of the above categories:

Not Scale Free: Networks that are neither SuperWeak nor Weakest.
This evaluation scheme is parameterized by the different fractions of simple graphs required by each evidence category. The particular thresholds given above are statistically motivated in order to control for false positives and overfitting, and to provide a consistent treatment across all networks (see Methods). A more permissive parameterization of the scheme is also considered as a robustness check. The above scheme favors finding evidence for scalefree structure in three ways: (i) graphs identified as being too dense or too sparse to be plausibly scale free are excluded from all analyses, (ii) the estimation procedure selects, by choosing k_{min}, the subset of data in the upper tail that bestfits a power law, and (iii) the comparisons to alternatives are performed only on the data selected by the power law.
Scaling parameters
Across the corpus, the distribution of median estimated scaling parameters parameters \(\hat \alpha\) is concentrated around a value of \(\hat \alpha = 2\), but with a long righttail such that 32% of data sets exhibit \(\hat \alpha \ge 3\) (Fig. 3). The range \(\alpha \in (2,3)\) is sometimes identified as including the most emblematic of scalefree networks^{8,9}, and we find that 39% of network data sets have median estimated parameters in this range. We also find that 34% of network data sets exhibit a median parameter \(\hat \alpha \ < \ 2\), which is a relatively unusual value in the scalefree network literature.
Because every network produces some \(\hat \alpha\), regardless of the statistical plausibility of the network being scale free, the shape of the distribution of \(\hat \alpha\) is not necessarily evidence for or against the ubiquity of scalefree networks. It does, however, enable a check of whether the estimation methods are biased by network size n. Comparing \(\hat \alpha\) and n, we find little evidence of strong systematic bias (r^{2} = 0.24, p = 1.82 × 10^{−13}; Supplementary Fig. 3).
Across the five categories of evidence for scalefree structure, the distribution of median \(\hat \alpha\) parameters varies considerably (Fig. 3, insets). For networks that fall into the SuperWeak category, the distribution has a similar breadth as the overall distribution, with a long righttail and many networks with \(\hat \alpha > 3\). Most of the networks with \(\hat \alpha \ < \ 2\) are spatial networks, representing mycelial fungal or slime mold growth patterns^{62}. However, few of these exhibit even SuperWeak or Weakest evidence of scalefree structure, indicating that they are not particularly plausible scalefree networks. Among the Weakest and Weak categories, the distribution of median \(\hat \alpha\) remains broad, with a substantial fraction exhibiting \(\hat \alpha > 3\). The Strong and Strongest categories require that \(\hat \alpha \in (2,3)\), and the few network data sets in these categories are somewhat concentrated near \(\hat \alpha = 2\).
Alternative distributions
Independent of whether the powerlaw model is a statistically good model of a network’s degree sequence, it may nevertheless be a better model than nonpowerlaw alternatives.
Across the corpus, likelihood ratio tests find only modest support for the powerlaw distribution over four alternatives (Table 1). In fact, the exponential distribution, which exhibits a thin tail and relatively low variance, is favored over the power law (41%) more often than viceversa (33%). This outcome accords with the broad distribution of scaling parameters, as when α > 3 (32% of data sets; Fig. 3), the degree distribution must have a relatively thin tail.
The lognormal is a broad distribution that can exhibit heavy tails, but which is nevertheless not scale free. Empirically, the lognormal is favored more than three times as often (48%) over the power law, as vice versa (12%), and the comparison is inconclusive in a large number of cases (40%). In other words, the lognormal is at least as good a fit as the power law for the vast majority of degree distributions (88%), suggesting that many previously identified scalefree networks may in fact be lognormal networks.
The Weibull or stretched exponential distribution can produce thin or heavy tails, and is a generalization of the exponential distribution. Compared to the power law, the Weibull is more often the better statistical model (47%) than vice versa (33%). Finally, the powerlaw distribution with an exponential cutoff requires special consideration, as it contains the pure powerlaw model as a special case. As a result, the likelihood of the power law can never exceed that of the cutoff model, and the interesting outcome is the degree to which the test is inconclusive between the two. In this case, a majority of networks (56%) favor the power law with cutoff model, indicating that finitesize effects may be common.
The above findings are corroborated by replacing the likelihood ratio test with information criteria to perform the model comparisons, which yield qualitatively similar conclusions (Supplementary Table II).
Assessing the scalefree hypothesis
Given the results of fitting, testing, and comparing the powerlaw distribution across networks, we now classify each according to the six categories described above.
Across the corpus, fully 49% of networks fall into the Not Scale Free category (Fig. 4). Slightly less than half (46%) fall into the SuperWeak category, in which a scalefree pattern among the degrees is not necessarily statistically plausible itself, but remains no less plausible than alternative distributions. The Weakest and Weak categories represent networks in which the powerlaw distribution is at least a statistically plausible model of the networks’ degree distributions. In the Weak case, this powerlaw scaling covers at least 50 nodes, a relatively modest requirement. These two categories account for only 29 and 19% of networks, respectively, indicating that it is uncommon for a network to exhibit direct statistical evidence of scalefree degree distributions.
Finally, only 10 and 4% of network data sets can be classified as belonging to the Strong or Strongest categories, respectively, in which the powerlaw distribution is not only statistically plausible, but the exponent falls within the special \(\alpha \in (2,3)\) range and the power law is a better model of the degrees than alternatives. Taken together, these results indicate that genuinely scalefree networks are far less common than suggested by the literature, and that scalefree structure is not an empirically universal pattern.
The balance of evidence for or against scalefree structure does vary by network domain (Fig. 5). These variations provide a means to check the robustness of our results, and can inform future efforts to develop new structural mechanisms. We focus our domainspecific analysis on networks from biological, social, and technological sources (91% of the corpus).
Among biological networks, a majority lack any direct or indirect evidence of scalefree structure (63% Not Scale Free; Fig. 5a), in agreement with past work on smaller corpora of biological networks^{42}. The aforementioned fungal networks represent a large share of these Not Scale Free networks, but this group also includes some protein interaction networks and some food webs. Among the remaining networks, one third exhibit only indirect evidence (33% SuperWeak), and a modest fraction exhibit the weakest form of direct evidence (19% Weakest). This latter group includes cat and rat brain connectomes. Compared to the corpus as a whole, biological networks are slightly more likely to exhibit the strongest level of direct evidence of scalefree structure (6% Strongest), and these are primarily metabolic networks.
We note that the fungal networks comprise 28% of the corpus and our analysis places 100% of them in the Not Scale Free category. Given their spatially embedded nature, it could be argued that these networks were unlikely to be scalefree in the first place. Because we know a posteriori that these networks are Not Scale Free, omitting them will necessarily increase the fraction of networks in at least some of the other categories. We find that these increases occur primarily in the weaker evidence categories: 5% of nonfungal networks fall into the Strongest category (up from 4%), 13% in Strong (from 10%), 27% in Weak (from 19%), 40% in Weakest (from 29%), and 65% SuperWeak (from 46%). Hence, the qualitative conclusions from our primary analysis are robust to the inclusion of this particular subset of networks.
In contrast, social networks present a different picture. Like the corpus overall, half of social networks lack any direct or indirect evidence of scalefree structure (50% Not Scale Free; Fig. 5b), while indirect evidence is slightly less prevalent (41% SuperWeak). The former group includes the Facebook100 online social networks, and the latter includes many Norwegian board of director networks.
However, among the categories representing direct evidence of scalefree structure, more networks fall into the Weakest (48%) and Weak (31%) categories, but not a single network falls into the Strong or Strongest categories. Hence social networks are at best only weakly scale free, and even in cases where the powerlaw distribution is plausible, nonscalefree distributions are often a better description of the data. The social networks exhibiting weak evidence include many scientific collaboration networks and roughly half of the Norwegian board of director networks.
Technological networks exhibit the smallest share of networks for which there is no evidence, direct or indirect, of scalefree structure (8% Not Scale Free; Fig. 5c), and the largest share exhibiting indirect evidence (90% SuperWeak). The former group includes some digital circuit networks and various water distribution networks. Among the categories representing direct evidence, less than half exhibit the weakest form of direct evidence (42% Weakest). This group includes roughly half of CAIDA’s networks of autonomous systems, several digital circuit networks, and several peertopeer networks. In contrast to biological or social networks, however, technological networks exhibit a modest fraction with strong direct evidence of scalefree structure (28% Strong). Networks in this category include the other half of the CAIDA graphs. But, almost none of the technological networks exhibit the strongest level of direct evidence (1% Strongest).
Transportation networks do not represent a large enough fraction of the corpus for a similar statistical analysis, but do offer some useful insights for future work. Most of these networks exhibit little evidence of scalefree structure. For example, all three airport networks and 46 of 49 road networks fall into the Not Scale Free category, while two of the remaining three road networks fall into the Weak category and one into SuperWeak. All of the subway networks fall into the SuperWeak category, and nearly all fall into the Weakest category. These results suggest that scalefree networks may represent poor models of many transportation systems.
Robustness analysis
In order to assess the dependence of these results on the evaluation scheme itself, we conduct a series of robustness tests.
Specifically, we test whether the above results hold qualitatively when (i) we consider only network data sets that are naturally simple (unweighted, undirected, monoplex, and no multiedges); (ii) we remove the powerlaw with cutoff from the set of alternative distributions; (iii) we lower the percentage thresholds for all categories to allow admission if any one constituent simple graph satisfies the requirements; and (iv) we analyze the scaling behavior of the degree distribution’s first and second moment ratio. Details for each of these tests, and two others, are given in Supplementary Note 5. We also test whether the evaluation scheme correctly classifies four different types of synthetic networks with known structure, both scale free and nonscale free. Details and results for these tests are given in Supplementary Note 6.
The first test evaluates whether the extension of the scalefree hypothesis to nonsimple networks and the corresponding graphsimplification procedure biases the results. The second evaluates whether the presence of finitesize effects drives the lack of evidence for scalefree distributions. Applied to the corpus, each test produces qualitatively similar results as the primary evaluation scheme (see Supplementary Note 5, and Supplementary Fig. 4), indicating that the lack of empirical evidence for scalefree networks is not driven by these particular choices in the evaluation scheme itself.
The third considers a “most permissive” parameterization, which evaluates the impact of our requirements that a minimum percentage of degree sequences satisfy the constraints of a category. Under this test, we specifically examine how the evidence changes if we instead require that only one degree sequence satisfies the given requirements. That is, this test lowers the threshold for each category to be maximally permissive: if scalefree structure exists in any associated degree sequence, the network data set is counted as falling into the corresponding category.
Under this modification, the Strong and Strongest categories become equivalent, and 18% of network data sets fall into this combined category (Fig. 6). We note that under this modified evaluation, synthetic directed networks assembled by preferential attachment should and do fall into the Strongest category of evidence. The most permissive category, SuperWeak, only changes slightly from 46 to 49%. And finally, performing this test on only the directed networks within the corpus produces similar results (see Supplementary Note 5 and Supplementary Fig. 5). These tests demonstrate that the percentage requirements used in the category definitions of the primary evaluation scheme are not overly restrictive, and our qualitative conclusions are robust to variations in the precise thresholds the evaluation uses.
The fourth test provides a modelindependent evaluation of a key prediction of the scalefree hypothesis. Scalefree distributions are mathematically unusual because only the moments \(\langle k^m\rangle\) for m < α – 1 are finite, and all higher moments diverge^{14}, asymptotically. Hence, in the most widely analyzed range of \(\alpha \in (2,3)\) for scalefree networks, the moment ratio \(\langle k^2\rangle /\langle k\rangle ^2\) diverges as the network size n increases. This behavior underpins the practical relevance of many theoretical analyses of scalefree networks. Of course, diverging moments cannot be identified from finitesized networks, and no realworld network can validate this prediction of the scalefree hypothesis. However, if most networks are scale free in this way, the scaling behavior of their moment ratios should exhibit a strongly diverging trend. Across the corpus as a whole, we find little evidence of a general pattern of diverging moment ratios (Fig. 7). Instead, we find enormous variation in ratios across networks, domains, and scales, such that networks with \(10^2 \le n \le 10^3\) often have larger ratios than networks several orders of magnitude larger, and even those moments that do appear to increase with n do not increase fast enough to be consistent with scalefree behavior (Supplementary Fig. 8). We leave a more detailed investigation of these variations for future work.
Overall, the results of these tests corroborate our primary findings of relatively little empirical evidence for the ubiquity of scalefree networks, and suggest that empirical degree distributions exhibit a richer variety of patterns, many of which are lower variance, than predicted by the scalefree hypothesis.
Discussion
By evaluating the degree distributions of nearly 1000 realworld networks from a wide range of scientific domains, we find that scalefree networks are not ubiquitous. Fewer than 36 networks (4%) exhibit the strongest level of evidence for scalefree structure, in which every degree distribution associated with a network is convincingly scale free. Only 29% of networks exhibit the weakest form, in which a power law is simply a statistically plausible model of some portion of the degree distribution’s upper tail. And, for 46% of networks, the powerlaw form is not necessarily itself a good model of the degree distribution, but is simply a statistically better model than alternatives. Nearly half (49%) of networks show no evidence, direct or indirect, of scalefree structure, and in 88% of networks, a lognormal fits the degree distribution as well as or better than a power law. These results demonstrate that scalefree networks are not a ubiquitous phenomenon, and suggest that their use as a starting point for modeling and analyzing the structure of real networks is not empirically well grounded.
Across different scientific domains, the evidence for scalefree structure is generally weak, but varies somewhat in interesting ways. These differences provide hints as to where scalefree structure may genuinely occur. For instance, our evidence indicates that scalefree patterns are more likely to be found in certain kinds of biological and technological networks. These findings corroborate theoretical work on domainspecific mechanisms for generating scalefree structure, e.g., in biological networks via the wellestablished duplicationmutation model for molecular networks^{3,30,54} or in certain kinds of technological networks via highly optimized tolerance^{13,63}.
In contrast, we find that social networks are at best weakly scale free, and although a powerlaw distribution can be a statistically plausible model for these networks, it is often not a better model than a nonscalefree distribution. Class imbalance in the corpus precludes broad conclusions about the prevalence of scalefree structure in information or transportation networks. However, the few of these in the corpus provide little indication that they would exhibit strongly different structural patterns than the better represented domains.
The variation of evidence across social, biological, and technological domains (Fig. 5) is consistent with a general conclusion that no single universal mechanism explains the wide diversity of degree structures found in realworld networks. The failure to find broad evidence for scalefree patterns in the degree distributions of networks indicates that much remains unknown about how network structure varies across different domains^{64} and what kinds of structural patterns are common across them. We look forward to new investigations of statistical differences and commonalities, which seem likely to generate new insights about the structure of complex systems.
The statistical evaluation here considers only the degree distributions of networks, and hence says relatively little about other structural patterns or the underlying processes that govern the form of any particular network. However, the finding that scalefree networks are empirically uncommon does imply a generally limited role for any mechanism that necessarily produces powerlaw degree distributions^{9,15,32,56}, especially in domains where the evidence for strongly scalefree networks is weak, e.g., social networks. The mechanisms that govern the shape of a particular network generally cannot be determined from a static network’s degree distribution alone, as it is both a weak constraint on network structure^{52} and a weak discriminator between mechanisms^{54}. For some networks, there is strong evidence that mechanisms like preferential attachment apply, e.g., scientific citation networks^{28,29,55,56}. However, the results described here imply that if such mechanisms apply more broadly, they are heavily modified or even dominated by other, perhaps domainspecific mechanisms. A claim that some network is scale free should thus be established using a severe statistical test^{58} that goes beyond static degree distributions.
In theoretical network science, assuming a power law for a random graph’s degree distribution can simplify mathematical analyses, and a power law can be a useful conceptual model for building intuition about the impact of extreme degree heterogeneity. And, for some types of calculations, e.g., the location of the epidemic threshold, scalefree networks can be useful models, even when realworld degree distributions are simply heavy tailed, rather than scale free^{65,66,67}. On the other hand, if a mathematical result depends strongly on the asymptotic behavior of a scalefree degree distribution, the results’ practical relevance will necessarily depend on the empirical prevalence of scalefree structures, which we show to be uncommon or rare, depending on the kind of scalefree structure of interest. Mathematical results based on extreme degree heterogeneity may, in fact, have more narrow applicability than previously believed, given the lack of evidence that empirical moment ratios diverge as quickly as those results typically assume (Fig. 7 and Supplementary Fig. 8).
The structural diversity of realworld networks uncovered here presents both a puzzle and an opportunity. The strong focus in the scientific literature on explaining and exploiting scalefree patterns has meant relatively less is known about mechanisms that produce nonscalefree structural patterns, e.g., those with degree distributions better fitted by a lognormal. Two important directions of future work will be the development and validation of novel mechanisms for generating more realistic degree structure in networks, and novel statistical techniques for identifying or untangling them given empirical data. Similarly, theoretical results concerning the behavior of dynamical processes running on top of networks, including spreading processes like epidemiological models, social influence models, or models of synchronization, may need to be reassessed in light of the genuine structural diversity of realworld networks.
The statistical methods and evidence categories developed and used in our evaluation of the scalefree hypothesis provide a quantitatively rigorous means by which to assess the degree to which some network exhibits scalefree structure. Their application to a novel network data set should enable future researchers to determine whether assuming scalefree structure is empirically justified.
Furthermore, large corpora of realworld networks, like the one used here, represent a powerful, datadriven resource by which to investigate the structural variability of realworld networks^{64}. Such corpora could be used to evaluate the empirical status of many other broad claims in the networks literature, including the tendency of social networks to exhibit high clustering coefficients and positive degree assortativity^{68}, the prevalence of the smallworld phenomena^{69}, the prevalence of “rich clubs” in networks^{70}, the ubiquity of community^{71} or hierarchical structure^{72}, and the existence of “superfamilies” of networks^{73}. We look forward to these investigations and the new insights they will bring to our understanding of the structure and function of networks.
Methods
Network data sets
Network data sets were obtained through the ICON^{59}, an online index of realworld network data sets from all domains of science. The composition of the corpus is roughly half biological networks, a third social or technological networks, and a sixth information or transportation networks (Supplementary Table 1). The 928 networks included span five orders of magnitude in size, are generally sparse with a mean degree of \(\langle k\rangle \approx 3\) (Fig. 1), and possess a range of graph properties, e.g., simple, directed, weighted, multiplex, temporal, or bipartite.
Prior to analysis, each network data set is transformed into one or more graphs, whose degree sequences can be unambiguously tested for a scalefree pattern (for example, Supplementary Fig. 1). For each nonsimple graph property of a network, a specific transformation is applied that increases the number of graphs in the data set while removing the given graph property. Full details of this process are given in Supplementary Note 1, and Supplementary Fig. 2. Complicated network data sets can produce a combinatoric number of simple graphs under this process. Treating every simplified degree sequence independently could lead to skewed results, e.g., if a few nonscalefree data sets account for a large fraction of the total extracted simple graphs. To avoid this bias, results are reported at the level of network data sets. Additionally, we require that simplified graphs are neither too sparse nor too dense to be potentially scale free and thus retain for analysis only simplified graphs with mean degree \(2 \ < \ \langle k\rangle \ < \ \sqrt n\).
Simplifying the 928 network data sets produced 18,448 simple graphs, of which 14,415 were excluded for being too sparse and 371 excluded for being too dense (about 80.4% of derived simple graphs). Results in the main text are reported only in terms of the remaining 3662 simple graphs (about 3.9 per network data set). Of the 928 network data sets, 735 (79%) produced no graphs that were excluded for being too sparse. More than 90% of graphs excluded for being too sparse were produced by simplifying three network data sets (<1% of the corpus). Similarly, 874 (94%) of the network data sets produced no graphs that were excluded for being too dense. More than 70% of graphs excluded for being too dense were produced by simplifying three network data sets. Finally, 782 (84%) of the data sets generated at most three degree sequences prior to applying the toosparse and toodense filters. Hence, the vast majority of data sets were uninvolved in the production of many excluded graphs.
Modeling degree distributions
For the degree sequence \(\{ k_i\} = k_1,k_2, \ldots ,k_n\) of a given network data set, we estimate the bestfitting powerlaw distribution of the form
where α is the scaling exponent, C is the normalization constant, and k is integer valued. This specification models only the distribution’s upper tail, i.e., degree values k ≥ k_{min}, and discards data from any nonpowerlaw portion in the lower distribution.
Fitting this model to an empirical degree sequence requires first choosing the location \(\hat k_{\mathrm{min}}\) at which the upper tail begins, and then estimating the scaling exponent \(\hat \alpha\) on the truncated data \(k \ge \hat k_{\mathrm{min}}\). Because the choice of k_{min} changes the sample size, it cannot be directly estimated using likelihood or Bayesian techniques. Here, the standard KSminimization approach is used to choose \(\hat k_{\mathrm{min}}\) and the discrete maximum likelihood estimator is used to choose \(\hat \alpha\)^{49}. Technical details of the estimation procedure are given in Supplementary Note 2.
Fitting the powerlaw distribution always returns some parameters \(\hat \theta = (\hat k_{{\mathrm{m}}in},\hat \alpha )\). However, parameters alone give no indication of the quality of the fitted model. A standard goodnessoffit test is used to assess the statistical plausibility of the fitted model, which returns a standard pvalue (see Supplementary Note 2). Following standard practice in this setting^{49}, if p ≥ 0.1, then the degree sequence is deemed plausibly scale free, while if p < 0.1, the scalefree hypothesis is rejected. Hence, if the underlying data generating process is indeed scale free, this test has a false negative rate of 0.1. The results of this test provide direct evidence for or against a network exhibiting scalefree structure.
Each powerlaw model \(\hat \theta\) is compared to four nonscalefree alternative models, estimated via maximum likelihood on the same degrees \(k \ge \hat k_{\mathrm{min}}\), using a standard Vuong normalized likelihood ratio test (LRT)^{49,60} (see Supplementary Notes 3, 4). The restriction to \(k \ge \hat k_{\mathrm{min}}\) is necessary to make the model likelihoods directly comparable, and slightly biases the test in favor of the power law, as the best choice of \(\hat k_{\mathrm{min}}\) for an alternative may not be the same as the best choice for the power law^{49}. The results of this test provide indirect evidence about the scalefree hypothesis, as a powerlaw model can be favored over some alternative even if the power law itself is not a statistically plausible model of the data. The nonscale free alternatives used here are the (i) exponential, (ii) lognormal, (iii) powerlaw with exponential cutoff, and (iv) stretched exponential or Weibull distributions (Table 1), all of which have been used previously as models of degree distributions^{74,75,76,77,78}, and for which the validity of the LRT used here has specifically been previously established^{49}. Results from an alternative comparison based on information criteria^{61} are given in Supplementary Table II and in Supplementary Figs. 6 and 7.
The fitted power law and each alternative are compared using a likelihood ratio test (see Supplementary Note 4), with the test statistic \({\cal R} = {\cal L}_{{\mathrm{PL}}}  {\cal L}_{{\mathrm{Alt}}},\) where \({\cal L}_{{\mathrm{PL}}}\) is the loglikelihood of the powerlaw model and \({\cal L}_{{\mathrm{Alt}}}\) is the loglikelihood of a particular alternative model. The sign of \({\cal R}\) indicates which model is a better fit to the data: the power law \(\left( {{\cal R} \ > \ 0} \right)\), the alternative \(({\cal R} \ < \ 0)\), or neither \(\left( {{\cal R} = 0} \right)\).
The test statistic \({\cal R}\) is derived from data, meaning that it is itself a random variable subject to statistical fluctuations^{49,60}. As a result, the sign of \({\cal R}\) is meaningful only if its magnitude \({\cal R}\) is statistically distinguishable from \(0\). This determination is made by a standard twotailed test against a null hypothesis of \({\cal R} = 0\), which yields a standard pvalue. If p ≥ 0.1, then \({\cal R}\) is statistically indistinguishable from 0 and neither model is a better explanation of the data than the other. If p < 0.1, then the data provide a clear conclusion in favor of one model or the other, depending on the sign of \({\cal R}\). This threshold sets the false positive rate for the alternative distribution at 0.05. Corrections for multiple tests, e.g., a familywise error rate method like Bonferroni or a false discovery correction like BenjaminiHochberg, are not employed. Such corrections would simply lower the obtained pvalues without changing the overall conclusions, while introducing additional assumptions into the analysis.
To report results at the level of a network data set, we apply the LRTs to all the associated simple graphs and then aggregate the results. For each alternative distribution, we count the number of simple graphs associated with a particular network data set in which the outcome favored the alternative, favored the power law, or had an inconclusive result. Normalizing these counts across outcome categories provides a continuous measure of the relative evidence that the data set falls into each of category.
Parameters for defining scalefree network
Threshold parameters for the primary evaluation criteria were selected to balance false positive and false negative rates, and to provide a consistent evaluation of evidence independent of the associated graph properties or source of data. For the SuperWeak and Weakest categories, a threshold of 50% ensures that the given property is present in a majority of simple graphs associated with a network data set. For the Weak category, a threshold of at least 50 nodes covered by the bestfitting power law in the upper tail follows standard practices^{49} to reduce the likelihood of false positive errors due to low statistical power. For the Strong category, \(\alpha \in (2,3)\) covers the full parameter range for which scalefree distributions have an infinite second moment but a finite first moment. For the Strongest category, the thresholds of 90% for the goodnessoffit test and 95% for likelihood ratio tests against alternatives match the expected error rates for both tests under the null hypothesis. If every graph associated with a network data set is scale free, the goodnessoffit test is expected to incorrectly reject the powerlaw model 0.1 of the time, and the likelihood ratio test will falsely favor the alternative 0.05 of the time. In the “most permissive” parameterization of the scheme (see Supplementary Note 5), we relax the threshold requirements so that if at least one graph meets the given criteria, the network is placed in this category. In this permissive parameterization, a directed network with a powerlaw distribution in the indegrees should be and is classified as Strongest.
For specific networks, domain knowledge may suggest that some degree sequences are potentially scale free while others are likely not. A nonuniform weighting scheme on the set of associated degree sequences would allow such prior knowledge to be incorporated in a Bayesian fashion. However, no fixed nonuniform scheme can apply universally correctly to networks as different as, for example, directed trade networks, directed social networks, and directed biological networks. To provide a consistent treatment across all networks, regardless of their properties or source, we employ an uninformative (uniform) prior, which assigns equal weight to each associated degree sequence. In future work on specific subgroups of networks, a domainspecific weight scheme could be used with the evaluation criteria described here.
Results for synthetic networks
The accuracy of the fitting, comparing, and testing methods, and the overall evaluation scheme itself, were evaluated using four classes of synthetic data with known structure. Three of these generated networks that contain powerlaw degree distributions: a directed version of preferential attachment^{79}, a directed vertex copy model^{21}, and a simple temporal powerlaw random graph. One generated networks that do not: simple ErdösRényi random graphs. Applied to synthetic networks generated by these models, our evaluation scheme correctly classified each of the synthetic network data sets according to the scalefree categories suitable for their generating parameters (see Supplementary Note 6).
Data availability
The network data sets used are available via https://icon.colorado.edu. Code for graphsimplification functions and powerlaw evaluations, and data for replication are available at https://github.com/adbroido/SFAnalysis.
References
 1.
Albert, R., Jeong, H. & Barabási, A. L. Diameter of the WorldWide Web. Nature 401, 130–131 (1999).
 2.
Pržulj, N. Biological network comparison using graphlet degree distribution. Bioinformatics 23, 177–183 (2007).
 3.
LimaMendez, G. & van Helden, J. The powerful law of the power law and other myths in network biology. Mol. Biosyst. 5, 1482–1493 (2009).
 4.
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P. & Bhattacharjee, B. Measurement and analysis of online social networks. Proc. 7th ACM SIGCOMM Conference on Internet Measurement (IMC). 29–42 (San Diego, CA, USA, 2007).
 5.
Agler, M. T. et al. Microbial Hub Taxa Link Host and abiotic factors to plant microbiome variation. PLoS Biol. 14, 1–31 (2016).
 6.
Ichinose, G. & Sayama, H. Invasion of cooperation in scalefree networks: accumulated versus average payoffs. Artif. Life 23, 25–33 (2017).
 7.
Zhang, L., Small, M. & Judd, K. Exactly scalefree scalefree networks. Phys. A 433, 182–197 (2015).
 8.
Dorogovtsev, S. N. & Mendes, J. F. F. Evolution of networks. Adv. Phys. 51, 1079–1187 (2002).
 9.
Barabási, A. L. & Albert, R. Emergence of scaling in random networks. Science 286, 509–512 (1999).
 10.
Willinger, W., Alderson, D. & Doyle, J. C. Mathematics and the internet: a source of enormous confusion and great potential. Not. AMS 56, 586–599 (2009).
 11.
PastorSatorras, R. & Vespignani, A. Epidemic dynamics in finite size scalefree networks. Phys. Rev. E 65, 035108 (2002).
 12.
Albert, R., Jeong, H. & Barabási, A.L. Error and attack tolerance of complex networks. Nature 406, 378–382 (2000).
 13.
Carlson, J. M. & Doyle, J. Highly optimized tolerance: a mechanism for power laws in designed systems. Phys. Rev. E 60, 1412–1427 (1999).
 14.
Newman, M. E. J. Power laws, Pareto distributions and Zipf’s law. Contemp. Phys. 46, 323–351 (2005).
 15.
Mitzenmacher, M. A brief history of generative models for power law and lognormal distributions. Internet Math. 1, 226–251 (2003).
 16.
Goh, K.I., Oh, E., Jeong, H., Kahng, B. & Kim, D. Classification of scalefree networks. Proc. Natl Acad. Sci. USA 99, 12583–12588 (2002).
 17.
PastorSatorras, R., Castellano, C., Van Mieghem, P. & Vespignani, A. Epidemic processes in complex networks. Rev. Mod. Phys. 87, 925–979 (2015).
 18.
PastorSatorras, R. & Vespignani, A. Epidemic spreading in scalefree networks. Phys. Rev. Lett. 86, 3200–3203 (2001).
 19.
Aiello, W., Chung, F. R. K. & Lu, L. A random graph model for massive graphs. Proc. 32nd Annual ACM Symposium on Theory of Computing. 171–180 (Portland, OR, USA, 2000).
 20.
Aiello, W., Chung, F. & Lu, L. A random graph model for power law graphs. Exp. Math. 10, 53–66 (2001).
 21.
Newman, M. Networks: An Introduction (Oxford Univerity Press, Oxford, 2010).
 22.
Newman, M. E. J. Spread of epidemic disease on networks. Phys. Rev. E 66, 016128 (2002).
 23.
Lee, D. S. Synchronization transition in scalefree networks: clusters of synchrony. Phys. Rev. E 72, 1–6 (2005).
 24.
Restrepo, J. G., Ott, E. & Hunt, B. R. Onset of synchronization in large networks of coupled oscillators. Phys. Rev. E 71, 1–12 (2005).
 25.
Ichinomiya, T. Frequency synchronization in a random oscillator network. Phys. Rev. E 70, 5 (2004).
 26.
Restrepo, J. G., Ott, E. & Hunt, B. R. Synchronization in large directed networks of coupled phase oscillators. Chaos 16, 015107 (2006).
 27.
Restrepo, J. G., Ott, E. & Hunt, B. R. Emergence of synchronization in complex networks of interacting dynamical systems. Phys. D. 224, 114–122 (2006).
 28.
Price, D. Jd. S. Networks of scientific papers. Science 149, 510–515 (1965).
 29.
Simon, H. A. On a class of skew distribution functions. Biometrika 42, 425–440 (1955).
 30.
PastorSatorras, R., Smith, E. & Solé, R. V. Evolving protein interaction networks through gene duplication. J. Theor. Biol. 222, 199–210 (2003).
 31.
Berger, N., Borgs, C., Chayes, J. T., D’Souza, R. M. & Kleinberg, R. D. Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP). 208–221 (Turku, Finland, 2004).
 32.
Leskovec, J., Kleinberg, J. & Faloutsos, C. Graph evolution. ACM Trans. Knowl. Discov. Data 1, 1–41 (2007).
 33.
Gamermann, D., Triana, J. & Jaime, R. A comprehensive statistical study of metabolic and proteinprotein interaction network properties. https://arxiv.org/abs/1712.07683 (2017).
 34.
House, T., Read, J. M., Danon, L. & Keeling, M. J. Testing the hypothesis of preferential attachment in social network formation. EPJ Data Science, https://doi.org/10.1140/epjds/s1368801500522 (2015).
 35.
A. Barabasi, Network Science (Cambridge University Press, Cambridge, UK, 2016).
 36.
Tanaka, R. Scalerich metabolic networks. Phys. Rev. Lett. 94, 1–4 (2005).
 37.
Li, L., Alderson, D., Tanaka, R., Doyle, J. C. & Willinger, W. Towards a theory of scalefree graphs: definition, properties, and implications (extended version). Internet Math. 2, 431–523 (2005).
 38.
Stumpf, M. P. H. & Porter, M. A. Critical truths about power laws. Science 335, 665–666 (2012).
 39.
Golosovsky, M. Powerlaw citation distributions are not scalefree. Phys. Rev. E 032306, 1–12 (2017).
 40.
Stumpf, M. P. H., Wiuf, C. & May, R. M. Subnets of scalefree networks are not scalefree: Sampling properties of networks. Proc. Natl Acad. Sci. USA 102, 4221–4224 (2005).
 41.
Jackson, M. O. & Rogers, B. W. Meeting strangers and friends of friends: how random are social networks? Am. Econ. Rev. 97, 890–915 (2007).
 42.
Khanin, R. & Wit, E. How scalefree are biological networks. J. Comp. Biol. 13, 810818 (2006).
 43.
Adamic, L. A. & Huberman, B. A. Technical comment on powerlaw distribution of the world wide web by A.L. Barabási and R. Albert and H. Jeong and G. Bianconi. Science 287, 2115 (2000).
 44.
Dorogovtsev, S. N., Mendes, J. F. F. & Samukhin, A. N. Generic scale of the “scalefree” growing networks. https://arxiv.org/abs/condmat/0011115 (2000).
 45.
Redner, S. How popular is your paper? An empirical study of the citation distribution. Eur. Phys. J. B 134, 131–134 (1998).
 46.
Pachon, A., Sacerdote, L. & Yang, S. Scalefree behavior of networks with the copresence of preferential and uniform attachment rules. Phys. D: Nonlinear Phenom. 371, 1–12 (2018).
 47.
Seshadhri, C., Pinar, A. & Kolda, T. G. An indepth analysis of stochastic Kronecker graphs. J. ACM 60, 1–30 (2011).
 48.
Eikmeier, N. & Gleich, D. F. Proc. 23rd ACM SIGKDD Internat. Conference on Knowledge Discovery and Data Mining (KDD). 817–826 (Halifax, NS, Canada, 2017).
 49.
Clauset, A., Shalizi, C. R. & Newman, M. E. J. Powerlaw distributions in empirical data. SIAM Rev. 51, 661–703 (2009).
 50.
Song, C., Havlin, S. & Makse, H. Selfsimilarity of complex networks. Nature 433, 392–395 (2005).
 51.
Dmitri Krioukov, M. Á. S. & Boguñá, M. Selfsimilarity of complex networks and hidden metric spaces. Phys. Rev. Lett. 100, 078701 (2008).
 52.
Alderson, D. L. & Li, L. Diversity of graphs with highly variable connectivity. Phys. Rev. E 75, 046102 (2007).
 53.
Mitzenmacher, M. Editorial: the future of power law research. Internet Math. 2, 525–534 (2004).
 54.
Middendorf, M., Ziv, E. & Wiggins, C. H. Inferring network mechanisms: The Drosophila melanogaster protein interaction network. Proc. Natl Acad. Sci. USA 102, 3192–3197 (2005).
 55.
Newman, M. E. J. The firstmover advantage in scientific publication. EPL 86, 68001 (2009).
 56.
Redner, S. Citation statistics from 110 years of physical review. Phys. Today 58, 49–54 (2005).
 57.
Radicchi, F., Fortunato, S. & Castellano, C. Universality of citation distributions: toward an objective measure of scientific impact. Proc. Natl Acad. Sci. USA 105, 17268–17272 (2008).
 58.
Mayo, D. G. Error and the Growth of Experimental Knowledge (Science and Its Conceptual Foundations series) (University of Chicago Press, Chicago, IL,1996).
 59.
Clauset, A., Tucker, E. & Sainz, M. The Colorado Index of Complex Networks, sanitize@url url icon.colorado.edu (2016).
 60.
Vuong, Q. H. Likelihood ratio tests for model selection and nonnested hypotheses. Econometrica 57, 307–333 (1989).
 61.
Claeskens, G. & Hjort, N. L. Model Selection and Model Averaging. (Cambridge University Press, Cambridge, England, 2008).
 62.
Lee, S. H., Fricker, M. D. & Porter, M. A. Mesoscale analyses of fungal networks as an approach for quantifying phenotypic traits. J. Complex Netw. 5, 145–159 (2017).
 63.
Newman, M. E. J., Girvan, M. & Farmer, J. D. Optimal design, robustness, and risk aversion. Phys. Rev. Lett. 89, 028301 (2002).
 64.
K. Ikehara, A. Clauset, Characterizing the structural diversity of complex networks across domains. https://arxiv.org/abs/1710.11304 (2017).
 65.
Barrat, A., Barthélemy, M. & Vespignani, A. Dynamical Processes on Complex Networks (Cambridge Univerity Press, Cambridge, UK, 2008).
 66.
Vespignani, A. Modelling dynamical processes in complex sociotechnical systems. Nat. Phys. 8, 32–39 (2012).
 67.
PastorSatorras, R. & Vespignani, A. Epidemic dynamics in finite size scalefree networks. Phys. Rev. E 65, 1–4 (2002).
 68.
Newman, M. E. J. & Park, J. Why social networks are different from other types of networks. Phys. Rev. E 68, 036122 (2003).
 69.
Watts, D. J. & Strogatz, S. H. Collective dynamics of ‘smallworld’ networks. Nature 393, 440–442 (1998).
 70.
Colizza, V., Flammini, A., Serrano, M. A. & Vespignani, A. Detecting richclub ordering in complex networks. Nat. Phys. 2, 110–115 (2006).
 71.
Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proc. Natl Acad.Sci. USA 99, 7821–7826 (2002).
 72.
Clauset, A., Moore, C. & Newman, M. E. J. Hierarchical structure and the prediction of missing links in networks. Nature 453, 98–101 (2008).
 73.
Milo, R. et al. Superfamilies of evolved and designed networks. Science 303, 1538–1542 (2004).
 74.
Amaral, L. A. N., Scala, A., Barthelemy, M. & Stanley, H. E. Classes of smallworld networks. Proc. Natl Acad. Sci. USA 97, 11149–11152 (2000).
 75.
Buzsáki, G. & Mizuseki, K. The logdynamic brain: how skewed distributions affect network operations. Nat. Rev. Neurosci. 15, 264–278 (2014).
 76.
Jeong, H., Mason, S. P., Barabási, A. L. & Oltvai, Z. N. Lethality and centrality in protein networks. Nature 411, 41–42 (2001).
 77.
Malevergne, Y., Pisarenko, V. F. & Sornette, D. Empirical distributions of logreturns: between the stretched exponential and the power law? Quant. Financ. 5, 379–401 (2005).
 78.
DuBois, T., Eubank, S. & Srinivasans, A. The effect of random edge removal on network degree sequence. Electron. J. Comb. 19, 1–20 (2012).
 79.
Easley, D. & Kleinberg, J. Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Cambridge University Press, Cambridge, UK, 2010).
Acknowledgements
The authors thank Eric Kightley, Johan Ugander, Cristopher Moore, Mark Newman, Cosma Shalizi, Alessandro Vespignani, Marc Barthelemy, Juan Restrepo, Petter Holme, and AlbertLászló Barabási for helpful conversations, and acknowledge the BioFrontiers Computing Core at the University of Colorado Boulder for providing high performance computing resources (NIH 1S10OD012300) supported by BioFrontiers IT. This work was supported in part by Grant No. IIS1452718 (A.C.) from the National Science Foundation. Publication of this article was funded by the University of Colorado Boulder Libraries Open Access Fund.
Author information
Affiliations
Contributions
A.D.B. and A.C. conceived the research, designed the analyzes, and wrote the manuscript. A.D.B. conducted the analyzes.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Journal peer review information: Nature Communications thanks the anonymous reviewers for their contribution to the peer review of this work.
Publisher’s note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Broido, A.D., Clauset, A. Scalefree networks are rare. Nat Commun 10, 1017 (2019). https://doi.org/10.1038/s41467019087465
Received:
Accepted:
Published:
Further reading

BiFlowLISA: Measuring spatial association for bivariate flow data
Computers, Environment and Urban Systems (2020)

A graph theory approach to analyze birth defect associations
PLOS ONE (2020)

Longtailed distributions of interevent times as mixtures of exponential distributions
Royal Society Open Science (2020)

Universal transient behavior in large dynamical systems on networks
Physical Review Research (2020)

Identifying time dependence in network growth
Physical Review Research (2020)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.