Self-similarity of complex networks

Chaoming Song, Shlomo Havlin, Hernán A. Makse

Research output: Contribution to journalArticle

819 Citations (Scopus)

Abstract

Complex networks have been studied extensively owing to their relevance to many real systems such as the world-wide web, the Internet, energy landscapes and biological and social networks. A large number of real networks are referred to as 'scale-free' because they show a power-law distribution of the number of links per node. However, it is widely believed that complex networks are not invariant or self-similar under a length-scale transformation. 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, rather than the power-law relation expected for a self-similar structure. Here we analyse a variety of real complex networks and find that, on the contrary, they consist of self-repeating patterns on all length scales. This result is achieved by the application of a renormalization procedure that coarse-grains the system into boxes containing nodes within a given 'size'. We identify a power-law relation between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent. These fundamental properties help to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.

Original languageEnglish (US)
Pages (from-to)392-395
Number of pages4
JournalNature
Volume433
Issue number7024
DOIs
StatePublished - Jan 27 2005
Externally publishedYes

Fingerprint

Internet
Social Support

ASJC Scopus subject areas

  • General

Cite this

Song, C., Havlin, S., & Makse, H. A. (2005). Self-similarity of complex networks. Nature, 433(7024), 392-395. https://doi.org/10.1038/nature03248

Self-similarity of complex networks. / Song, Chaoming; Havlin, Shlomo; Makse, Hernán A.

In: Nature, Vol. 433, No. 7024, 27.01.2005, p. 392-395.

Research output: Contribution to journalArticle

Song, C, Havlin, S & Makse, HA 2005, 'Self-similarity of complex networks', Nature, vol. 433, no. 7024, pp. 392-395. https://doi.org/10.1038/nature03248
Song C, Havlin S, Makse HA. Self-similarity of complex networks. Nature. 2005 Jan 27;433(7024):392-395. https://doi.org/10.1038/nature03248
Song, Chaoming ; Havlin, Shlomo ; Makse, Hernán A. / Self-similarity of complex networks. In: Nature. 2005 ; Vol. 433, No. 7024. pp. 392-395.
@article{9e2804cfd9474ffc8d66b46525805ba5,
title = "Self-similarity of complex networks",
abstract = "Complex networks have been studied extensively owing to their relevance to many real systems such as the world-wide web, the Internet, energy landscapes and biological and social networks. A large number of real networks are referred to as 'scale-free' because they show a power-law distribution of the number of links per node. However, it is widely believed that complex networks are not invariant or self-similar under a length-scale transformation. 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, rather than the power-law relation expected for a self-similar structure. Here we analyse a variety of real complex networks and find that, on the contrary, they consist of self-repeating patterns on all length scales. This result is achieved by the application of a renormalization procedure that coarse-grains the system into boxes containing nodes within a given 'size'. We identify a power-law relation between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent. These fundamental properties help to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.",
author = "Chaoming Song and Shlomo Havlin and Makse, {Hern{\'a}n A.}",
year = "2005",
month = "1",
day = "27",
doi = "10.1038/nature03248",
language = "English (US)",
volume = "433",
pages = "392--395",
journal = "Nature",
issn = "0028-0836",
publisher = "Nature Publishing Group",
number = "7024",

}

TY - JOUR

T1 - Self-similarity of complex networks

AU - Song, Chaoming

AU - Havlin, Shlomo

AU - Makse, Hernán A.

PY - 2005/1/27

Y1 - 2005/1/27

N2 - Complex networks have been studied extensively owing to their relevance to many real systems such as the world-wide web, the Internet, energy landscapes and biological and social networks. A large number of real networks are referred to as 'scale-free' because they show a power-law distribution of the number of links per node. However, it is widely believed that complex networks are not invariant or self-similar under a length-scale transformation. 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, rather than the power-law relation expected for a self-similar structure. Here we analyse a variety of real complex networks and find that, on the contrary, they consist of self-repeating patterns on all length scales. This result is achieved by the application of a renormalization procedure that coarse-grains the system into boxes containing nodes within a given 'size'. We identify a power-law relation between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent. These fundamental properties help to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.

AB - Complex networks have been studied extensively owing to their relevance to many real systems such as the world-wide web, the Internet, energy landscapes and biological and social networks. A large number of real networks are referred to as 'scale-free' because they show a power-law distribution of the number of links per node. However, it is widely believed that complex networks are not invariant or self-similar under a length-scale transformation. 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, rather than the power-law relation expected for a self-similar structure. Here we analyse a variety of real complex networks and find that, on the contrary, they consist of self-repeating patterns on all length scales. This result is achieved by the application of a renormalization procedure that coarse-grains the system into boxes containing nodes within a given 'size'. We identify a power-law relation between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent. These fundamental properties help to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.

UR - http://www.scopus.com/inward/record.url?scp=13444263410&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=13444263410&partnerID=8YFLogxK

U2 - 10.1038/nature03248

DO - 10.1038/nature03248

M3 - Article

C2 - 15674285

AN - SCOPUS:13444263410

VL - 433

SP - 392

EP - 395

JO - Nature

JF - Nature

SN - 0028-0836

IS - 7024

ER -