Scaling properties of scale-free evolving networks: Continuous approach
Open accessThe DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
The scaling behavior of scale-free evolving networks, arising in areas such as communications, scientific citations, collaborations, etc., is studied. We derive universal scaling relations describing properties of such networks, and indicate the limits of their validity. We show that the main properties of scale-free evolving networks may be described in the framework of a simple continuous approach. The simplest models of networks, growing according to a mechanism of preferential attachment of links to nodes, are used. We consider different forms of this preference, and demonstrate that the range of preferential attachments producing scale-free networks is wide. We also obtain scaling relations for networks with nonlinear, accelerating growth, and describe the temporal evolution of the arising distributions. Size effects-the cutoffs of these distributions-introduce restrictions for the observation of power-law dependences. Mainly we discuss the so-called degree distribution, i.e., the distribution of the number of connections of nodes. A scaling form of the distribution of links between pairs of individual nodes for a growing network of citations is also studied. We describe the effects of differences between nodes. The "aging" of nodes changes the exponents of the distributions. The appearance of a single node with high fitness changes the degree distribution of a network dramatically. If its fitness exceeds some threshold value, this node captures a finite part of all links of the network. We show that permanent random damage to a growing scale-free network-a permanent deletion of some links-radically changes the values of the scaling exponents. Results of other kinds of permanent damage are described.
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
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
SIMON, H. A. (1955) · Biometrika · doi:10.1093/biomet/42.3-4.425 · Cited by 2,771
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Self-citationCritical 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
Self-citationFood-web structure and network theory: The role of connectance and size
Dunne, J. A., Williams, R. J., & Martinez, N. D. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.192407699 · Cited by 1,519
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
Spectra of “real-world” graphs: Beyond the semicircle law
Farkas, I. J., Derényi, I., Barabási, A.-L., & Vicsek, T. (2001) · Physical Review E · doi:10.1103/physreve.64.026704 · Cited by 499
Social network analysis: An overview
Tabassum, S., Pereira, F. S. F., Fernandes, S., & Gama, J. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1256 · Cited by 419
Defining and identifying Sleeping Beauties in science
Ke, Q., Ferrara, E., Radicchi, F., & Flammini, A. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1424329112 · Cited by 416
Duplication Models for Biological Networks
Chung, F., Lu, L., Dewey, T. G., & Galas, D. J. (2003) · Journal of Computational Biology · doi:10.1089/106652703322539024 · Cited by 322
Size-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
Self-citationGiant strongly connected component of directed networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.64.025101 · Cited by 303
Self-citationSmall-world behavior in time-varying graphs
Tang, J., Scellato, S., Musolesi, M., Mascolo, C., & Latora, V. (2010) · Physical Review E · doi:10.1103/physreve.81.055101 · Cited by 301
The Economics of Social Networks
Jackson, M. O. (2013) · Advances in Economics and Econometrics · doi:10.1017/cbo9781139052269.003 · Cited by 264
Hills, T. T., Maouene, M., Maouene, J., Sheya, A., & Smith, L. (2009) · Psychological Science · doi:10.1111/j.1467-9280.2009.02365.x · Cited by 258
Birth and death of protein domains: A simple model of evolution explains power law behavior
Karev, G. P., Wolf, Y. I., Rzhetsky, A. Y., Berezovskaya, F. S., & Koonin, E. V. (2002) · BMC Evolutionary Biology · doi:10.1186/1471-2148-2-18 · Cited by 175
Multiple weak hits confuse complex systems: A transcriptional regulatory network as an example
Ágoston, V., Csermely, P., & Pongor, S. (2005) · Physical Review E · doi:10.1103/physreve.71.051909 · Cited by 111
Metadata
- Authors
- Dorogovtsev, S. N., & Mendes, J. F. F.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2001-04-26
- Volume
- 63
- Issue
- 5
- Pages
- 056125-056125
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1967440046
- Cited by
- 258
- References
- 26
- FWCI
- 9.05
- 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.