Exact scaling properties of a hierarchical network model

Abstract

We report on exact results for the degree $K$, the diameter $D$, the clustering coefficient $C$, and the betweenness centrality $B$ of a hierarchical network model with a replication factor $M$. Such quantities are calculated exactly with the help of recursion relations. Using the results, we show that (i) the degree distribution follows a power law $P_K\sim K^{-\gamma }$ with $\gamma =1+\ln M/\ln (M-1)$, (ii) the diameter grows logarithmically as $D\sim \ln N$ with the number of nodes $N$, (iii) the clustering coefficient of each node is inversely proportional to its degree, $C\propto 1/K$, and the average clustering coefficient is nonzero in the infinite $N$ limit, and (iv) the betweenness centrality distribution follows a power law $P_B\sim B^{-2}$. We discuss a classification scheme of scale-free networks into the universality class with the clustering property and the betweenness centrality distribution.

4 pages

References in corpus (2)

• Hierarchical organization of modularity in metabolic networks
• Stability of shortest paths in complex networks with random edge weights

Cited by in corpus (30)

• Multiscale characteristics of the emerging global cryptocurrency market
• A deterministic small-world network created by edge iterations
• Recursive graphs with small-world scale-free properties
• Quantum Google in a Complex Network
• Spectral Analysis and the Dynamic Response of Complex Networks
• High dimensional random Apollonian networks
• High Dimensional Apollonian Networks
• A general geometric growth model for pseudofractal scale-free web
• Trapping in scale-free networks with hierarchical organization of modularity
• Evolving small-world networks with geographical attachment preference
• Scale free effects in world currency exchange network
• Random walks in modular scale-free networks with multiple traps
• Average distance in a hierarchical scale-free network: an exact solution
• Degree-dependent intervertex separation in complex networks
• Constrained spin dynamics description of random walks on hierarchical scale-free networks
• Deterministic hierarchical networks
• Epidemic Variability in Hierarchical Geographical Networks with Human Activity Patterns
• Deterministic weighted scale-free small-world networks
• Functionally Fractal Urban Networks: Geospatial Co-location and Homogeneity of Infrastructure
• Learning in Hierarchical Social Networks
• Random walks in unweighted and weighted modular scale-free networks with a perfect trap
• An alternative approach to determining average distance in a class of scale-free modular networks
• Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
• Deterministic scale-free networks created in a recursive manner
• Self-similar planar graphs as models for complex networks
• On the metric dimension and fractional metric dimension for hierarchical product of graphs
• Quantum Google Algorithm: Construction and Application to Complex Networks
• Analysis of a network structure of the foreign currency exchange market
• Random Walks on Complex Networks
• A new general family of deterministic hierarchical networks