A general model of hierarchical fractal scale-free networks

Abstract

We propose a general model of unweighted and undirected networks having the scale-free property and fractal nature. Unlike the existing models of fractal scale-free networks (FSFNs), the present model can systematically and widely change the network structure. In this model, an FSFN is iteratively formed by replacing each edge in the previous generation network with a small graph called a generator. The choice of generators enables us to control the scale-free property, fractality, and other structural properties of hierarchical FSFNs. We calculate theoretically various characteristic quantities of networks, such as the exponent of the power-law degree distribution, fractal dimension, average clustering coefficient, global clustering coefficient, and joint probability describing the nearest-neighbor degree correlation. As an example of analyses of phenomena occurring on FSFNs, we also present the critical point and critical exponents of the bond-percolation transition on infinite FSFNs, which is related to the robustness of networks against edge removal. By comparing the percolation critical points of FSFNs whose structural properties are the same as each other except for the clustering nature, we clarify the effect of the clustering on the robustness of FSFNs. As demonstrated by this example, the present model makes it possible to elucidate how a specific structural property influences a phenomenon occurring on FSFNs by varying systematically the structures of FSFNs. Finally, we extend our model for deterministic FSFNs to a model of non-deterministic ones by introducing asymmetric generators and reexamine all characteristic quantities and the percolation problem for such non-deterministic FSFNs.

arXiv comment24 pages, 5 figures

References in corpus (35)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Assortative mixing in networks
• Epidemic processes in complex networks
• Synchronization in complex networks
• The spread of epidemic disease on networks
• Network robustness and fragility: Percolation on random graphs
• Spatial Networks
• Resilience of the Internet to random breakdowns
• Critical phenomena in complex networks
• Self-similarity of complex networks
• Dynamical and correlation properties of the Internet
• Breakdown of the Internet under intentional attack
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Origins of fractality in the growth of complex networks
• Weighted evolving networks: coupling topology and weights dynamics
• Pseudofractal Scale-free Web
• Class of correlated random networks with hidden variables
• The Statistical Physics of Real-World Networks
• Unification of theoretical approaches for epidemic spreading on complex networks
• Percolation on complex networks: Theory and application
• Fractal and Transfractal Recursive Scale-Free Nets
• Log-Networks
• Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
• Degree-degree correlations in random graphs with heavy-tailed degrees
• Uncovering disassortativity in large scale-free networks
• Percolation in Hierarchical Scale-Free Nets
• Betweenness Centrality of Fractal and Non-Fractal Scale-Free Model Networks and Tests on Real Networks
• Dimension Theory of Graphs and Networks
• Anomalous behavior of trapping on a fractal scale-free network
• Generating-function approach for bond percolations in hierarchical networks
• An ensemble of random graphs with identical degree distribution
• Stochastic and mixed flower graphs
• Absence of the non-percolating phase for percolation on the non-planar Hanoi network
• Phase transition without global ordering in a hierarchical scale-free network

Cited by in corpus (4)

• Scaling theory of fractal complex networks
• Bifractality of fractal scale-free networks
• Model-based reconstruction of real-world fractal complex networks
• Random walks on bifractal networks