Bifractality of fractal scale-free networks
arXiv:2304.13438 · doi:10.1103/PhysRevE.108.024302
Abstract
The presence of large-scale real-world networks with various architectures has motivated an active research towards a unified understanding of diverse topologies of networks. Such studies have revealed that many networks with the scale-free and fractal properties exhibit the structural multifractality, some of which are actually bifractal. Bifractality is a particular case of the multifractal property, where only two local fractal dimensions and suffice to explain the structural inhomogeneity of a network. In this work, we investigate analytically and numerically the multifractal property of a wide range of fractal scale-free networks (FSFNs) including deterministic hierarchical, stochastic hierarchical, non-hierarchical, and real-world FSFNs. Then we demonstrate how commonly FSFNs exhibit the bifractal property. The results show that all these networks possess the bifractal nature. We conjecture from our findings that any FSFN is bifractal. Furthermore, we find that in the thermodynamic limit the lower local fractal dimension describes substructures around infinitely high-degree hub nodes and finite-degree nodes at finite distances from these hub nodes, whereas characterizes local fractality around finite-degree nodes infinitely far from the infinite-degree hub nodes. Since the bifractal nature of FSFNs may strongly influence time-dependent phenomena on FSFNs, our results will be useful for understanding dynamics such as information diffusion and synchronization on FSFNs from a unified perspective.
arXiv comment12 pages, 5 figures
References in corpus (30)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- The diameter of the world wide web
- Random graphs with arbitrary degree distributions and their applications
- Evolution of networks
- Self-similarity of complex networks
- Origins of fractality in the growth of complex networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Skeleton and fractal scaling in complex networks
- Fractal and Transfractal Recursive Scale-Free Nets
- Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
- First passage time for random walks in heterogeneous networks
- Fractality in complex networks: critical and supercritical skeletons
- Betweenness Centrality of Fractal and Non-Fractal Scale-Free Model Networks and Tests on Real Networks
- Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
- Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
- Multifractality of complex networks
- Fractal and multifractal properties of a family of fractal networks
- Multifractal analysis of complex networks
- Correlations in connected random graphs
- Fractal and multifractal analysis of complex networks: Estonian network of payments
- Origin of the hub spectral dimension in scale-free networks
- Fractality and degree correlations in scale-free networks
- A general formulation of long-range degree correlations in complex networks
- A general model of hierarchical fractal scale-free networks
- A Fixed-Mass multifractal approach for unweighted complex networks
- A computationally-efficient sandbox algorithm for multifractal analysis of large-scale complex networks with tens of millions of nodes
- Emergence of Long-Range Correlations in Random Networks
- Identification of intrinsic long-range degree correlations in complex networks