Self-similarity of complex networks
Chaoming Song, Shlomo Havlin, and Hernan A. Makse

TL;DR
This paper demonstrates that complex networks, previously thought not to be self-similar due to their small-world nature, actually exhibit self-similarity when analyzed with a renormalization approach, revealing underlying scale-invariant properties.
Contribution
The authors introduce a novel renormalization method that uncovers self-similarity in complex networks, challenging the traditional view that such networks lack scale invariance.
Findings
Complex networks are self-similar under renormalization.
A power-law relation exists between the number of boxes and box size.
Self-similarity is observed in WWW, social, cellular, and protein networks.
Abstract
Complex networks have been studied extensively due to their relevance to many real systems as diverse as the World-Wide-Web (WWW), the Internet, energy landscapes, biological and social networks \cite{ab-review,mendes,vespignani,newman,amaral}. A large number of real networks are called ``scale-free'' because they show a power-law distribution of the number of links per node \cite{ab-review,barabasi1999,faloutsos}. However, it is widely believed that complex networks are not {\it length-scale} invariant or self-similar. This conclusion originates from the ``small-world'' property of these networks, which implies that the number of nodes increases exponentially with the ``diameter'' of the network \cite{erdos,bollobas,milgram,watts}, rather than the power-law relation expected for a self-similar structure. Nevertheless, here we present a novel approach to the analysis of such networks,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
