In this paper, firstly, we study analytically the topological features of a family of hierarchical lattices (HLs) from the view point of complex networks. We derive some basic properties of HLs controlled by a parameter q: scale-free degree distribution with exponent γ=2+ln 2/(ln q), null clustering coefficient, power-law behavior of grid coefficient, exponential growth of average path length (non-small-world), fractal scaling with dimension dB=ln (2q)/(ln 2), and disassortativity. Our results show that scale-free networks are not always small-world, and support the conjecture that self-similar scale-free networks are not assortative. Secondly, we define a deterministic family of graphs called small-world hierarchical lattices (SWHLs). Our construction preserves the structure of hierarchical lattices, including its degree distribution, fractal architecture, clustering coefficient, while the small-world phenomenon arises. Finally, the dynamical processes of intentional attacks and collective synchronization are studied and the comparisons between HLs and Barabási-Albert (BA) networks as well as SWHLs are shown. We find that the self-similar property of HLs and SWHLs significantly increases the robustness of such networks against targeted damage on hubs, as compared to the very vulnerable non fractal BA networks, and that HLs have poorer synchronizability than their counterparts SWHLs and BA networks. We show that degree distribution of scale-free networks does not suffice to characterize their synchronizability, and that networks with smaller average path length are not always easier to synchronize.
展开▼
