Effective dimensions and percolation in hierarchically structured scale-free networks
Condensed Matter
2007-09-23 v1
Abstract
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial character of this network that displays scale-free connectivity among other features, it turns out to be approximately one-dimensional. The dimensional characterization is in agreement with the results on statistics of site percolation and other dynamical processes implemented on such a network.
Cite
@article{arxiv.cond-mat/0302515,
title = {Effective dimensions and percolation in hierarchically structured scale-free networks},
author = {Victor M. Eguiluz and Emilio Hernandez-Garcia and Oreste Piro and Konstantin Klemm},
journal= {arXiv preprint arXiv:cond-mat/0302515},
year = {2007}
}
Comments
5 pages, 5 figures