An iterative model builds higher-order fractal networks that are scale-free in generalized degree distribution for large multipliers, with fractal properties confirmed by similarity and box-counting dimensions.
How to calculate the fractal dimension of a complex network: the box covering algorithm.Journal of Statistical Mechanics: Theory and Experiment, 2007(03):P03006–P03006, March 2007
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Iterative Generation and Generalized Degree Distribution of Higher-Order Fractal Scale-Free Networks
An iterative model builds higher-order fractal networks that are scale-free in generalized degree distribution for large multipliers, with fractal properties confirmed by similarity and box-counting dimensions.