Fractal boundaries of complex networks

Jia Shao, Sergey V. Buldyrev, R. Cohen, Maksim Kitsak, Shlomo Havlin, H. Eugene Stanley

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce the concept of the boundary of a complex network as the set of nodes at distance larger than the mean distance from a given node in the network. We study the statistical properties of the boundary nodes seen from a given node of complex networks. We find that for both Erdős-Rényi and scale-free model networks, as well as for several real networks, the boundaries have fractal properties. In particular, the number of boundaries nodes B follows a power law probability density function which scales as B-2. The clusters formed by the boundary nodes seen from a given node are fractals with a fractal dimension df≈2. We present analytical and numerical evidences supporting these results for a broad class of networks.
Original languageAmerican English
JournalEurophysics Letters: a letters journal exploring the frontiers of physics
Volume84
Issue number4
StatePublished - 2008

Fingerprint

Dive into the research topics of 'Fractal boundaries of complex networks'. Together they form a unique fingerprint.

Cite this