pith. sign in

arxiv: 0804.1968 · v1 · pith:EVXOLM6Tnew · submitted 2008-04-11 · 🧮 math-ph · cond-mat.dis-nn· cond-mat.stat-mech· math.MP· physics.data-an· physics.soc-ph

Fractal Boundaries of Complex Networks

classification 🧮 math-ph cond-mat.dis-nncond-mat.stat-mechmath.MPphysics.data-anphysics.soc-ph
keywords boundariesnetworksnodescomplexfractaldistancenetworkproperties
0
0 comments X
read the original abstract

We introduce the concept of boundaries 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 boundaries nodes of complex networks. We find that for both Erd\"{o}s-R\'{e}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 {\it B} follows a power-law probability density function which scales as $B^{-2}$. The clusters formed by the boundary nodes are fractals with a fractal dimension $d_{f} \approx 2$. We present analytical and numerical evidence supporting these results for a broad class of networks. Our findings imply potential applications for epidemic spreading.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.