Transfinite fractal dimension of trees and hierarchical scale-free graphs
arXiv:1808.02674 · doi:10.1093/comnet/cnz005
Abstract
In this paper, we introduce a new concept: the transfinite fractal dimension of graph sequences motivated by the notion of fractality of complex networks proposed by Song et al. We show that the definition of fractality cannot be applied to networks with `tree-like' structure and exponential growth rate of neighborhoods. However, we show that the definition of fractal dimension could be modified in a way that takes into account the exponential growth, and with the modified definition, the fractal dimension becomes a proper parameter of graph sequences. We find that this parameter is related to the growth rate of trees. We also generalize the concept of box dimension further and introduce the transfinite Cesaro fractal dimension. Using rigorous proofs we determine the optimal box-covering and transfinite fractal dimension of various models: the hierarchical graph sequence model introduced by Komjáthy and Simon, Song-Havlin-Makse model, spherically symmetric trees, and supercritical Galton-Watson trees.
arXiv comment26 pages, 6 figures
References in corpus (14)
- Emergence of scaling in random networks
- Hierarchical Organization in Complex Networks
- Self-similarity of complex networks
- Origins of fractality in the growth of complex networks
- Pseudofractal Scale-free Web
- Deterministic Scale-Free Networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Fractal and Transfractal Recursive Scale-Free Nets
- Self-similar Scale-free Networks and Disassortativity
- High Dimensional Apollonian Networks
- Evolving Apollonian Networks with Small-world Scale-free topologies
- Generating hierarchial scale free graphs from fractals
- Structures in supercritical scale-free percolation
- Deterministic scale-free networks created in a recursive manner