The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The degree sequence of a scale‐free random graph process
Abstract
Recently, Barabási and Albert [2] suggested modeling complex real‐world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional to their degrees. In [2] and, with Jeong, in [3], Barabási and Albert suggested that after many steps the proportion P(d) of vertices with degree d should obey a power law P(d)α d−γ. They obtained γ=2.9±0.1 by experiment and gave a simple heuristic argument suggesting that γ=3. Here we obtain P(d) asymptotically for all d≤n1/15, where n is the number of vertices, proving as a consequence that γ=3. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18, 279–290, 2001
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
Cites
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
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Bollobás, B. (1985) · Cited by 6,196
Self-citationThe Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
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
Gilbert, E. N. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706098 · Cited by 1,122
Weighted sums of certain dependent random variables
Azuma, K. (1967) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178243286 · Cited by 1,084
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
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
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
The Architecture of Complexity
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.384127 · Cited by 805
Durrett, R. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546594 · Cited by 780
Meeting Strangers and Friends of Friends: How Random Are Social Networks?
Jackson, M. O., & Rogers, B. W. (2007) · American Economic Review · doi:10.1257/aer.97.3.890 · Cited by 633
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-citationConvergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
Borgs, C., Chayes, J. T., Lovász, L., Sós, V. T., & Vesztergombi, K. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.07.008 · Cited by 590
A survey of random processes with reinforcement
Pemantle, R. (2007) · Probability Surveys · doi:10.1214/07-ps094 · Cited by 578
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
Self-citationMathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
Self-citationGraph theory and networks in Biology
Mason, O., & Verwoerd, M. (2007) · IET Systems Biology · doi:10.1049/iet-syb:20060038 · Cited by 398
Fundamentals of Stein’s method
Ross, N. (2011) · Probability Surveys · doi:10.1214/11-ps182 · Cited by 387
CENTRALITY ESTIMATION IN LARGE NETWORKS
BRANDES, U., & PICH, C. (2007) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127407018403 · Cited by 384
Why rumors spread so quickly in social networks
Doerr, B., Fouz, M., & Friedrich, T. (2012) · Communications of the ACM · doi:10.1145/2184319.2184338 · Cited by 357
On compressing social networks
Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., & Raghavan, P. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557049 · Cited by 349
Cooper, C., & Frieze, A. (2003) · Random Structures & Algorithms · doi:10.1002/rsa.10084 · Cited by 344
Bollobás, B., Borgs, C., Chayes, J., & Riordan, O. M. (2003) · doi:10.5555/644108.644133 · Cited by 302
Self-citationA Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Blitzstein, J., & Diaconis, P. (2011) · Internet Mathematics · doi:10.1080/15427951.2010.557277 · Cited by 291
Epidemic Propagation With Positive and Negative Preventive Information in Multiplex Networks
Wang, Z., Xia, C., Chen, Z., & Chen, G. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2960605 · Cited by 289
Robustness 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-citationUsing 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
Adiabatic Quantum Algorithm for Search Engine Ranking
Garnerone, S., Zanardi, P., & Lidar, D. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230506 · Cited by 102
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
Litvak, N., Scheinhardt, W. R. W., & Volkovich, Y. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129293 · Cited by 62
PageRank of Scale-Free Growing Networks
Avrachenkov, K., & Lebedev, D. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129120 · Cited by 44
Metadata
- Authors
- Bollobás, B., Riordan, O., Spencer, J., & Tusnády, G.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 2001-04-18
- Volume
- 18
- Issue
- 3
- Pages
- 279-290
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2056380633
- Cited by
- 804
- References
- 18
- FWCI
- 10.45
- 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.