Cited by 36,135Complex Network Analysis TechniquesComplex Systems and Time Series AnalysisTheoretical and Computational Physics

Emergence of Scaling in Random Networks

Open access
Barabási, Albert-László, Albert, Réka·1999·Science

Abstract

Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1126/science.286.5439.509

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Other topologically constrained networks such as transportation networks and internet routers face similar issues.

    “Other topologically constrained networks such as transportation networks and internet routers face similar issues.6”

    From Graph theory analysis of complex brain networks: new concepts in brain mapping applied to neurosurgery (2016) · cites this paper as [6]

    The passage labeled Abstract (page unavailable) names transportation networks among complex networks that may share growth and preferential attachment. It discusses the World Wide Web, but not internet routers, and does not establish that either example faces the unspecified “similar issues” as a topologically constrained network. (LLM, conf=0.83)

    Experimental — accuracy not yet measured
  • The in-degree distribution in the #Ferguson network follows roughly a powerlaw, with a small number of nodes receiving a disproportionately high number of retweets and mentions, and most receiving none at all.

    “Like most social networks, the in-degree distribution in the #Ferguson network follows roughly a powerlaw, with a small number of nodes receiving a disproportionately high number of retweets and mentions, and most receiving none at all (Barabási & Albert, 1999).”

    From #Ferguson is everywhere: initiators in emerging counterpublic networks (2016) · cites this paper as Barabási & Albert, 1999

    The paper’s network discussion (page unavailable in our copy) reports a power-law tail for an actor collaboration network and says highly connected nodes can dominate connectivity. It does not examine the #Ferguson network, retweets or mentions, or establish that most nodes in that network receive none. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • In a scale-free network, only few linguistic units have the strong general syntactic capacity to combine with other linguistic units (words), while most other linguistic units have weaker combining ability.

    “A network with the power-law distribution of degrees has the property of scale-freeness, showing that only few linguistic units have the strong general syntactic capacity to combine with other linguistic units (words), while most other linguistic units have weaker combining ability (Barabási and Albert, 1999).”

    From Syntactic Networks of Interlanguage Across L2 Modalities and Proficiency Levels (2021) · cites this paper as Barabási and Albert, 1999

    The passage labeled Abstract (page not provided) describes scale-free networks with power-law connectivity and highly connected vertices, supporting the general idea that connectivity is uneven. It does not discuss linguistic units or establish that a word’s number of connections measures its syntactic capacity to combine with other words. (LLM, conf=0.86)

    Experimental — accuracy not yet measured
  • The distribution of degrees of vertices in a random network generally follows the Poisson distribution.

    “The distribution of degrees of vertices in a complex network and a random network generally follows the power-law distribution and Poisson distribution, respectively (Barabási and Albert, 1999; Newman, 2003, 2010).”

    From Syntactic Networks of Interlanguage Across L2 Modalities and Proficiency Levels (2021) · cites this paper as Barabási and Albert, 1999

    The passage on the Erdős–Rényi (ER) random graph model says its vertex degrees follow a Poisson distribution. It does not establish this for random networks generally: the paper also describes many large random networks, including its own growth model, whose degree distributions follow a power law. The supplied copy labels these passages as Abstract and provides no page number. (LLM, conf=0.87)

    Experimental — accuracy not yet measured
  • Complex network theory has demonstrated that many non-quantum systems exhibit similarities in their complex features, in the organization of their structure and dynamics, the controllability of their constituents, and their resilience to structural and dynamical perturbations.

    “complex network theory has demonstrated that many (non-quantum) systems exhibit similarities in their complex features 14 -18 , in the organization of their structure and dynamics 19 -24 , the controllability of their constituents 25 , and their resilience to structural and dynamical perturbations 26 -31 .”

    From Complex networks from classical to quantum (2019) · cites this paper as [15]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 16

  1. R. Gallagher and T. Appenzeller, Science 284, 79 (1999);
  2. R. F. Service, Science 284, 80 (1999).
  3. G. Weng, U. S. Bhalla, R. Iyengar, Science 284, 92 (1999).
  4. C. Koch and G. Laurent, Science 284, 96 (1999).
  5. R. Albert, H. Jeong and A.-L. Barabási, Nature 401, 130 (1999), see also http://www.nd.edu/∼networks.
  6. P. Erdős, and A. Rényi, Publ. Math. Inst. Hung. Acad. Sci 5, 17 (1960);
  7. S. Lawrence and C. L. Giles, Science 280, 98 (1998); Nature 400, 107 (1999).
  8. B. A. Huberman and L. A. Adamic, Nature 401, 131 (1999)], the distribution of searches
  9. B. A. Huberman, P. L. T. Pirolli, J. E. Pitkow and R. J. Lukose, Science 280, 95 (1998)], or the number of links per webpage (6).
  10. D. J. Watts and S. H. Strogatz, Nature 393, 440 (1998).
  11. S. Redner, European Physical Journal B 4, 131 (1998).
  12. S. Milgram, Psychol. Today 2, 60 (1967);
  13. M. Kochen (ed.) The Small World (Ablex, Norwood, NJ, 1989).
  14. M. Barthélémy and L. A. N. Amaral, Phys. Rev. Lett. 82, 15 (1999).
  15. W. B. Arthur, Science 284, 107 (1999).
  16. J. R. Banavar, A. Maritan and A. Rinaldo, Nature 399, 130 (1999).

Cited by

Sorted by citations

Authors
Barabási, A.-L., & Albert, R.
Affiliations
Department of Physics, University of Notre Dame, Notre Dame, IN 46556, USA.
Venue
Science
Published
1999-10-15
Volume
286
Issue
5439
Pages
509-512
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2008620264
Cited by
36,135
References
19
Citations by year
2026: 1122 · 2025: 1428 · 2024: 1382 · 2023: 1410 · 2022: 1628 · 2021: 1838 · 2020: 1757 · 2019: 1878 · 2018: 1959 · 2017: 1885 · 2016: 1886 · 2015: 1997 · 2014: 2037 · 2013: 1914 · 2012: 1848
FWCI
104.59
Type
journal article
Language
en
Open access
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
  • Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
Keywords
scale-free networks, power-law degree distribution, random networks, preferential attachment, network expansion, self-organization, complex network topology, vertex connectivity

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review