The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Origins of fractality in the growth of complex networks
Open accessAbstract
Complex networks from such different fields as biology, technology or sociology share similar organization principles. The possibility of a unique growth mechanism promises to uncover universal origins of collective behaviour. In particular, the emergence of self-similarity in complex networks raises the fundamental question of the growth process according to which these structures evolve. Here we investigate the concept of renormalization as a mechanism for the growth of fractal and non-fractal modular networks. We show that the key principle that gives rise to the fractal architecture of networks is a strong effective ‘repulsion’ (or, disassortativity) between the most connected nodes (that is, the hubs) on all length scales, rendering them very dispersed. More importantly, we show that a robust network comprising functional modules, such as a cellular network, necessitates a fractal topology, suggestive of an evolutionary drive for their existence.
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
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
The Fractal Geometry of Nature
Mandelbrot, B. B., & Wheeler, J. A. (1983) · American Journal of Physics · doi:10.1119/1.13295 · Cited by 21,832
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
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
The Fractal Geometry of Nature.
Sparrow, C., & Mandelbrot, B. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981858 · Cited by 14,546
Phase Transitions and Critical Phenomena
(2016) · Statistical and Thermal Physics · doi:10.1201/9781439850541-13 · Cited by 11,176
Stochastic Processes in Physics and Chemistry
(2007) · Elsevier eBooks · doi:10.1016/b978-0-444-52965-7.x5000-4 · Cited by 8,692
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
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Cited by
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
From time series to complex networks: the visibility graph
Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709247105 · Cited by 1,826
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Complex network approaches to nonlinear time series analysis
Zou, Y., Donner, R. V., Marwan, N., Donges, J. F., & Kurths, J. (2019) · Physics Reports · doi:10.1016/j.physrep.2018.10.005 · Cited by 634
First-passage times in complex scale-invariant media
Condamin, S., Bénichou, O., Tejedor, V., Voituriez, R., & Klafter, J. (2007) · Nature · doi:10.1038/nature06201 · Cited by 627
A complex network approach to supply chain network theory
Hearnshaw, E. J. S., & Wilson, M. M. J. (2013) · International Journal of Operations & Production Management · doi:10.1108/01443571311307343 · Cited by 487
Challenges in the vulnerability and risk analysis of critical infrastructures
Zio, E. (2016) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2016.02.009 · Cited by 429
Gallos, L. K., Makse, H. A., & Sigman, M. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1106612109 · Cited by 398
Self-citationHow to calculate the fractal dimension of a complex network: the box covering algorithm
Song, C., Gallos, L. K., Havlin, S., & Makse, H. A. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/03/p03006 · Cited by 345
Self-citationSelf-Similarity of Complex Networks and Hidden Metric Spaces
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.078701 · Cited by 332
On the origins of hierarchy in complex networks
Corominas-Murtra, B., Goñi, J., Solé, R. V., & Rodríguez-Caso, C. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1300832110 · Cited by 160
The evolutionary origins of hierarchy
Mengistu, H., Huizinga, J., Mouret, J.-B., & Clune, J. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004829 · Cited by 115
Metadata
- Authors
- Song, C., Havlin, S., & Makse, H. A.
- Venue
- Nature Physics
- Published
- 2006-04
- Volume
- 2
- Issue
- 4
- Pages
- 275-281
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2160058983
- Cited by
- 613
- References
- 34
- FWCI
- 17.80
- 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.