We report on the 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 [Formula presented] with [Formula presented] (ii) the diameter grows logarithmically as [Formula presented] with the number of nodes N, (iii) the clustering coefficient of each node is inversely proportional to its degree, [Formula presented] and the average clustering coefficient is nonzero in the infinite N limit, and (iv) the betweenness centrality distribution follows a power law [Formula presented] We discuss a classification scheme of scale-free networks into the universality class with the clustering property and the betweenness centrality distribution. © 2003 The American Physical Society.
CITATION STYLE
Noh, J. D. (2003). Exact scaling properties of a hierarchical network model. Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 67(4), 4. https://doi.org/10.1103/PhysRevE.67.045103
Mendeley helps you to discover research relevant for your work.