The DOI matches its Crossref record.
Scale-free characteristics of random networks: the topology of the world-wide web
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Evolution of the social network of scientific collaborations
Barabási, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00736-7 · Cited by 1,972
Self-citationComplex Contagions and the Weakness of Long Ties
Centola, D., & Macy, M. (2007) · American Journal of Sociology · doi:10.1086/521848 · Cited by 1,878
Neural reuse: A fundamental organizational principle of the brain
Anderson, M. L. (2010) · Behavioral and Brain Sciences · doi:10.1017/s0140525x10000853 · Cited by 1,212
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
Self-citationWhite matter maturation reshapes structural connectivity in the late developing human brain
Hagmann, P., Sporns, O., Madan, N., Cammoun, L., Pienaar, R., Wedeen, V. J., Meuli, R., Thiran, J.-P., & Grant, P. E. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009073107 · Cited by 700
Morgan, R. J., & Soltesz, I. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0801372105 · Cited by 347
Maximal planar networks with large clustering coefficient and power-law degree distribution
Zhou, T., Yan, G., & Wang, B.-H. (2005) · Physical Review E · doi:10.1103/physreve.71.046141 · Cited by 265
Dyhrfjeld-Johnsen, J., Santhakumar, V., Morgan, R. J., Huerta, R., Tsimring, L., & Soltesz, I. (2007) · Journal of Neurophysiology · doi:10.1152/jn.00950.2006 · Cited by 230
It's who you know: graph mining using recursive structural features
Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., & Faloutsos, C. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020512 · Cited by 223
Using PageRank to Characterize Web Structure
Pandurangan, G., Raghavan, P., & Upfal, E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45655-4_36 · Cited by 164
Discovering Opinion Spammer Groups by Network Footprints
Ye, J., & Akoglu, L. (2015) · Proceedings of the 2015 ACM on Conference on Online Social Networks · doi:10.1145/2817946.2820606 · Cited by 84
A Complex Network Approach to Urban Growth
Andersson, C., Frenken, K., & Hellervik, A. (2006) · Environment and Planning A: Economy and Space · doi:10.1068/a37418 · Cited by 67
PageRank of Scale-Free Growing Networks
Avrachenkov, K., & Lebedev, D. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129120 · Cited by 44
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17
Metadata
- Authors
- Barabási, A.-L., Albert, R., & Jeong, H.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2000-06
- Volume
- 281
- Issue
- 1-4
- Pages
- 69-77
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2117495845
- Cited by
- 1,408
- References
- 0
- FWCI
- 21.15
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
