The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Connectivity of Growing Random Networks
Open accessAbstract
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented. The network is built by adding sites that link to earlier sites with a probability A(k) which depends on the number of preexisting links k to that site. For homogeneous connection kernels, A(k) approximately k(gamma), different behaviors arise for gamma<1, gamma>1, and gamma = 1. For gamma<1, the number of sites with k links, N(k), varies as a stretched exponential. For gamma>1, a single site connects to nearly all other sites. In the borderline case A(k) approximately k, the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2<nu
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Cited by
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Power-Law Distributions in Empirical Data
Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009) · SIAM Review · doi:10.1137/070710111 · Cited by 8,019
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
Bassett, D. S., & Bullmore, E. (2006) · The Neuroscientist · doi:10.1177/1073858406293182 · Cited by 2,600
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
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
Showing your ID: intrinsic disorder as an ID for recognition, regulation and cell signaling
Uversky, V. N., Oldfield, C. J., & Dunker, A. K. (2005) · Journal of Molecular Recognition · doi:10.1002/jmr.747 · Cited by 847
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
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712
Popularity versus similarity in growing networks
Papadopoulos, F., Kitsak, M., Serrano, M. Á., Boguñá, M., & Krioukov, D. (2012) · Nature · doi:10.1038/nature11459 · Cited by 634
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.65.066122 · Cited by 540
Citation Statistics from 110 Years of Physical Review
Redner, S. (2005) · Physics Today · doi:10.1063/1.1996475 · Cited by 426
Self-citationSize-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311
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
Large-scale curvature of networks
Narayan, O., & Saniee, I. (2011) · Physical Review E · doi:10.1103/physreve.84.066108 · Cited by 145
CONNECTING THE DOTS: TOWARDS ARCHAEOLOGICAL NETWORK ANALYSIS
BRUGHMANS, T. (2010) · Oxford Journal of Archaeology · doi:10.1111/j.1468-0092.2010.00349.x · Cited by 148
Krioukov, D., Kitsak, M., Sinkovits, R. S., Rideout, D., Meyer, D., & Boguñá, M. (2012) · Scientific Reports · doi:10.1038/srep00793 · Cited by 128
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
Exponential random simplicial complexes
Zuev, K., Eisenberg, O., & Krioukov, D. (2015) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/48/46/465002 · Cited by 49
Metadata
- Authors
- Krapivsky, P. L., Redner, S., & Leyvraz, F.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2000-11-20
- Volume
- 85
- Issue
- 21
- Pages
- 4629-4632
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2032516423
- Cited by
- 1,197
- References
- 2
- FWCI
- 25.51
- Type
- journal article
- Language
- en
- Open access
- green
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.