Skeleton and fractal scaling in complex networks

Preprint

13 January 2006

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0508332

Abstract

We find that the fractal scaling in a class of scale-free networks originates from the underlying tree structure called skeleton, a special type of spanning tree based on the edge betweenness centrality. The fractal skeleton has the property of the critical branching tree. The original fractal networks are viewed as a fractal skeleton dressed with local shortcuts. An in-silico model with both the fractal scaling and the scale-invariance properties is also constructed. The framework of fractal networks is useful in understanding the utility and the redundancy in networked systems.

Keywords

BETWEENNESS CENTRALITY
NETWORKED SYSTEMS
FRACTAL SKELETON
FRACTAL NETWORKS
FRACTAL SCALING
LOCAL SHORTCUTS
SKELETON
PROPERTY
TREE

All Related Versions

Version 1, 2005-08-13, ArXiv
Version 2, 2006-01-13, ArXiv
Published version: Physical Review Letters, 96 (1), 018701.

This publication has 0 references indexed in Scilit: