The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The Diameter of a Scale-Free Random Graph
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 3×
“Barab´ asi and Albert [ 3 ], as well as several other groups (see [5 ]a nd the references therein), noticed that in many real-world examples the fraction P (k) of vertices with degree k follows a power law over a large range, with P (k) proportional to k −γ for some constant γ independent of the scale of”
BackgroundMethodInfluentialError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Bollobás, B. (1985) · Cited by 6,196
Self-citationRandom graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Scale-free characteristics of random networks: the topology of the world-wide web
Barabási, A.-L., Albert, R., & Jeong, H. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00018-2 · Cited by 1,408
The degree sequence of a scale‐free random graph process
Bollobás, B., Riordan, O., Spencer, J., & Tusnády, G. (2001) · Random Structures & Algorithms · doi:10.1002/rsa.1009 · Cited by 804
Self-citationBollobás, B. (1981) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1981-0621971-7 · Cited by 201
Self-citationNote on the heights of random recursive trees and random m‐ary search trees
Pittel, B. (1994) · Random Structures & Algorithms · doi:10.1002/rsa.3240050207 · Cited by 180
The Diameter of a Cycle Plus a Random Matching
Bollobás, B., & Chung, F. R. K. (1988) · SIAM Journal on Discrete Mathematics · doi:10.1137/0401033 · Cited by 176
Self-citationOn a Nonuniform Random Recursive Tree
Szymański, J. (1987) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)73062-7 · Cited by 92
On the structure of random plane‐oriented recursive trees and their branches
Mahmoud, H. M., Smythe, R. T., & Szymański, J. (1993) · Random Structures and Algorithms · doi:10.1002/rsa.3240040204 · Cited by 81
ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
Stoimenow, A. (1998) · Journal of Knot Theory and Its Ramifications · doi:10.1142/s0218216598000073 · Cited by 76
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
A Brief History of Generative Models for Power Law and Lognormal Distributions
Mitzenmacher, M. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129088 · Cited by 1,188
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Metadata
- Authors
- Bollob�s*, B., & Riordan, O.
- Venue
- Combinatorica
- Published
- 2004-01-01
- Volume
- 24
- Issue
- 1
- Pages
- 5-34
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2061118827
- Cited by
- 594
- References
- 15
- FWCI
- 28.66
- 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.