The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Organization of growing random networks
Open accessAbstract
The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability ${A}_{k}.$ When ${A}_{k}$ grows more slowly than linearly with k, the number of nodes with k links, ${N}_{k}(t),$ decays faster than a power law in k, while for ${A}_{k}$ growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When ${A}_{k}$ is asymptotically linear, ${N}_{k}(t)\ensuremath{\sim}{\mathrm{tk}}^{\ensuremath{-}\ensuremath{\nu}},$ with $\ensuremath{\nu}$ dependent on details of the attachment probability, but in the range $2<\ensuremath{\nu}<\ensuremath{\infty}.$ The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node---namely, its ``descendants'' and ``ancestors''---are also determined. The in component exhibits a robust ${s}^{\ensuremath{-}2}$ power-law tail, where s is the component size. The out component has a typical size of order $\mathrm{ln}t,$ and it provides basic insights into the genealogy of the network.
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
Kinetische Behandlung der Keimbildung in übersättigten Dämpfen
Becker, R., & Döring, W. (1935) · Annalen der Physik · doi:10.1002/andp.19354160806 · Cited by 3,155
Garfield, E. (1972) · Science · doi:10.1126/science.178.4060.471 · Cited by 2,788
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
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
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
Scale-Free Networks from Varying Vertex Intrinsic Fitness
Caldarelli, G., Capocci, A., De Los Rios, P., & Muñoz, M. A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.258702 · Cited by 794
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
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.65.066122 · Cited by 540
Evolutionary dynamics on any population structure
Allen, B., Lippner, G., Chen, Y.-T., Fotouhi, B., Momeni, N., Yau, S.-T., & Nowak, M. A. (2017) · Nature · doi:10.1038/nature21723 · Cited by 534
Citation Statistics from 110 Years of Physical Review
Redner, S. (2005) · Physics Today · doi:10.1063/1.1996475 · Cited by 426
Self-citationMaximal 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
Stochastic modeling of citation slips
Simkin, M. V., & Roychowdhury, V. P. (2005) · Scientometrics · doi:10.1007/s11192-005-0028-2 · Cited by 135
A mathematical theory of citing
Simkin, M. V., & Roychowdhury, V. P. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20653 · Cited by 93
The memory of science: Inflation, myopia, and the knowledge network
Pan, R. K., Petersen, A. M., Pammolli, F., & Fortunato, S. (2018) · Journal of Informetrics · doi:10.1016/j.joi.2018.06.005 · Cited by 79
Generalizations of Polya's urn Problem
Chung, F., Handjani, S., & Jungreis, D. (2003) · Annals of Combinatorics · doi:10.1007/s00026-003-0178-y · Cited by 73
Local leaders in random networks
Blondel, V. D., Guillaume, J.-L., Hendrickx, J. M., de Kerchove, C., & Lambiotte, R. (2008) · Physical Review E · doi:10.1103/physreve.77.036114 · Cited by 69
Preferential Attachment in Online Networks: Measurement and Explanations
Kunegis, J., Blattner, M., & Moser, C. (2013) · arXiv · doi:10.48550/arxiv.1303.6271 · Cited by 14
Metadata
- Authors
- Krapivsky, P. L., & Redner, S.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-05-24
- Volume
- 63
- Issue
- 6
- Pages
- 066123-066123
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1992021819
- Cited by
- 871
- References
- 3
- FWCI
- 24.61
- 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.
