Highly clustered scale-free networks
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the network is considered. As the network grows, the clustering reaches an asymptotic value larger than that for regular lattices of the same average connectivity and similar to the one observed in the networks of movie actors, coauthorship in science, and word synonyms. These highly clustered scale-free networks indicate that memory effects are crucial for a correct description of the dynamics of growing networks.
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
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
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
Bollobás, B. (1985) · Cited by 6,196
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
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
ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
SIMON, H. A. (1955) · Biometrika · doi:10.1093/biomet/42.3-4.425 · Cited by 2,771
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
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
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Complex Contagions and the Weakness of Long Ties
Centola, D., & Macy, M. (2007) · American Journal of Sociology · doi:10.1086/521848 · Cited by 1,878
Attack vulnerability of complex networks
Holme, P., Kim, B. J., Yoon, C. N., & Han, S. K. (2002) · Physical Review E · doi:10.1103/physreve.65.056109 · Cited by 1,891
Deciphering microbial interactions and detecting keystone species with co-occurrence networks
Berry, D., & Widder, S. (2014) · Frontiers in Microbiology · doi:10.3389/fmicb.2014.00219 · Cited by 1,756
Why social networks are different from other types of networks
Newman, M. E. J., & Park, J. (2003) · Physical Review E · doi:10.1103/physreve.68.036122 · Cited by 1,354
The Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?
Nishikawa, T., Motter, A. E., Lai, Y.-C., & Hoppensteadt, F. C. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.014101 · Cited by 839
Scale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
From hairballs to hypotheses–biological insights from microbial networks
Röttjers, L., & Faust, K. (2018) · FEMS Microbiology Reviews · doi:10.1093/femsre/fuy030 · Cited by 714
Kronecker Graphs: An Approach to Modeling Networks
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 697
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
“One such mechanism is node activation/deactivation [66] motivated by citation networks.”
BackgroundMeeting 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
Vázquez, A. (2003) · Physical Review E · doi:10.1103/physreve.67.056104 · Cited by 563
Absence of Epidemic Threshold in Scale-Free Networks with Degree Correlations
Boguñá, M., Pastor-Satorras, R., & Vespignani, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.028701 · Cited by 548
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
Newman, M. E. J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.058701 · Cited by 497
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Efficiency of scale-free networks: error and attack tolerance
Crucitti, P., Latora, V., Marchiori, M., & Rapisarda, A. (2003) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)01545-5 · Cited by 483
Class of correlated random networks with hidden variables
Boguñá, M., & Pastor-Satorras, R. (2003) · Physical Review E · doi:10.1103/physreve.68.036112 · Cited by 452
Statistical analysis of 22 public transport networks in Poland
Sienkiewicz, J., & Hołyst, J. A. (2005) · Physical Review E · doi:10.1103/physreve.72.046127 · Cited by 434
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
Epidemic Threshold in Structured Scale-Free Networks
Eguíluz, V. M., & Klemm, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.108701 · Cited by 353
Self-citationGrowing scale-free networks with small-world behavior
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.057102 · Cited by 339
Self-citationAverage path length in random networks
Fronczak, A., Fronczak, P., & Hołyst, J. A. (2004) · Physical Review E · doi:10.1103/physreve.70.056110 · Cited by 326
Voter model dynamics in complex networks: Role of dimensionality, disorder, and degree distribution
Suchecki, K., Eguíluz, V. M., & San Miguel, M. (2005) · Physical Review E · doi:10.1103/physreve.72.036132 · Cited by 286
Self-citationFor Your Citations Only? Hot Topics in Bibliometric Analysis
van Raan, A. F. J. (2005) · Measurement: Interdisciplinary Research & Perspective · doi:10.1207/s15366359mea0301_7 · Cited by 280
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
The Economics of Social Networks
Jackson, M. O. (2013) · Advances in Economics and Econometrics · doi:10.1017/cbo9781139052269.003 · Cited by 264
Epidemic Spreading in Complex Networks with Degree Correlations
Boguá, M., Pastor-Satorras, R., & Vespignani, A. (2003) · Lecture Notes in Physics · doi:10.1007/978-3-540-44943-0_8 · Cited by 263
Semantic Networks: Structure and Dynamics
Borge-Holthoefer, J., & Arenas, A. (2010) · Entropy · doi:10.3390/e12051264 · Cited by 237
“The Klemm–Eguiluz (KE) model seeks to reproduce the high clustering coefficient usually found in real networks, which the BA model fails to reproduce [45].”
Background
Metadata
- Authors
- Klemm, K., & Eguíluz, V. M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-02-21
- Volume
- 65
- Issue
- 3
- Pages
- 036123-036123
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1974672547
- Cited by
- 395
- References
- 20
- FWCI
- 14.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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.