The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Mathematical results on scale‐free random graphs
Abstract
Introduction Classical models of random graphs Results for classical random graphs The Watts-Strogatz ‘small-world’ model Scale-free models The Barabási-Albert model The LCD model and Gm(n) The Buckley-Osthus model The copying model The Cooper-Frieze model Directed scale-free graphs Clustering coefficient and small subgraphs Pairings on [0, 1] and the diameter of the LCD model Robustness and vulnerability The case [0, 1]: plane-oriented recursive trees Conclusion References
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Bollobás, B. (1985) · Cited by 6,196
Self-citationDiameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Random 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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
SIMON, H. A. (1955) · Biometrika · doi:10.1093/biomet/42.3-4.425 · Cited by 2,771
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
The frequency distribution of scientific productivity
Lotka, A. J. (1926) · Journal of the Washington Academy of Sciences · Cited by 2,246
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
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
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Growing scale-free networks with tunable clustering
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.026107 · Cited by 1,088
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-citationStochastic models for the Web graph
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892065 · Cited by 676
The Diameter of a Scale-Free Random Graph
Bollob�s*, B., & Riordan, O. (2004) · Combinatorica · doi:10.1007/s00493-004-0002-2 · Cited by 594
Self-citationThe evolution of random graphs
Bollobás, B. (1984) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1984-0756039-5 · Cited by 415
Self-citationA Random Graph Model for Power Law Graphs
Aiello, W., Chung, F., & Lu, L. (2001) · Experimental Mathematics · doi:10.1080/10586458.2001.10504428 · Cited by 405
The birth of the giant component
Janson, S., Knuth, D. E., Łuczak, T., & Pittel, B. (1993) · Random Structures & Algorithms · doi:10.1002/rsa.3240040303 · Cited by 389
Bollobás, B., Borgs, C., Chayes, J., & Riordan, O. M. (2003) · doi:10.5555/644108.644133 · Cited by 302
Self-citationRobustness and Vulnerability of Scale-Free Random Graphs
Bollobás, B., & Riordan, O. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129080 · Cited by 273
Self-citationA Simulation of the Structure of Academic Science
Gilbert, N. (1997) · Sociological Research Online · doi:10.5153/sro.85 · Cited by 222
Component behavior near the critical point of the random graph process
Łuczak, T. (1990) · Random Structures & Algorithms · doi:10.1002/rsa.3240010305 · Cited by 215
Bergeron, F., Flajolet, P., & Salvy, B. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55251-0_2 · Cited by 208
Note 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-citationBollobás, B. (1981) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1981-0621971-7 · Cited by 159
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
Shortest paths and load scaling in scale-free trees
Szabó, G., Alava, M. J., & Kertész, J. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.66.026101 · Cited by 90
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
Variations on Random Graph Models for the Web
Drinea, E., Enachescu, M., & Mitzenmacher, M. (2001) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 67
(1949) · Max Planck Digital Library
Cited by
Powell, W. W., White, D. R., Koput, K. W., & Owen‐Smith, J. (2005) · American Journal of Sociology · doi:10.1086/421508 · Cited by 2,016
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Scale-free networks in cell biology
Albert, R. (2005) · Journal of Cell Science · doi:10.1242/jcs.02714 · Cited by 1,215
Structure and evolution of online social networks
Kumar, R., Novak, J., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150476 · Cited by 1,084
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
Metadata
- Authors
- Bollobás, B., & Riordan, O. M.
- Venue
- Handbook of Graphs and Networks
- Publisher
- Wiley
- Published
- 2002-11-08
- Pages
- 1-34
- OpenAlex
- W1572923654
- Cited by
- 463
- References
- 36
- Type
- other
- 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.