Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices

Abstract

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$. 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, 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 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.

26 pages, 8 figures

References in corpus (58)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Epidemic spreading in scale-free networks
• Assortative mixing in networks
• Hierarchical organization of modularity in metabolic networks
• Evolution of networks
• Mixing patterns in networks
• Specificity and stability in topology of protein networks
• Network robustness and fragility: Percolation on random graphs
• Hierarchical Organization in Complex Networks
• Attack vulnerability of complex networks
• Epidemic dynamics and endemic states in complex networks
• Synchronization in small-world systems
• Self-similarity of complex networks
• Dynamical and correlation properties of the Internet
• Breakdown of the Internet under intentional attack
• Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
• Scale-Free Networks are Ultrasmall
• Large-scale topological and dynamical properties of Internet
• Origins of fractality in the growth of complex networks
• Epidemic spreading in correlated complex networks
• Pseudofractal Scale-free Web
• Deterministic Scale-Free Networks
• Class of correlated random networks with hidden variables
• Highly clustered scale-free networks
• Memory-Based Snowdrift Game on Networks
• Generic scale of the "scale-free" growing networks
• Maximal planar networks with large clustering coefficient and power-law degree distribution
• Self-organization of collaboration networks
• Resilience to damage of graphs with degree correlations
• Skeleton and fractal scaling in complex networks
• Integrating static and dynamic information for routing traffic
• A Geometric Fractal Growth Model for Scale Free Networks
• Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
• Self-similar disk packings as model spatial scale-free networks
• A deterministic small-world network created by edge iterations
• Rate equation approach for correlations in growing network models
• Recursive graphs with small-world scale-free properties
• Number of loops of size h in growing scale-free networks
• Exactly solvable analogy of small-world networks
• Chaos and Synchronized Chaos in an Earthquake Model
• High dimensional random Apollonian networks
• Self-similar Scale-free Networks and Disassortativity
• Deterministic Small-World Networks
• High Dimensional Apollonian Networks
• Disease Spreading in Structured Scale-Free Networks
• Evolving Apollonian Networks with Small-world Scale-free topologies
• A general geometric growth model for pseudofractal scale-free web
• Distance-d covering problems in scale-free networks with degree correlations
• Comment on "Breakdown of the Internet under Intentional Attack"
• Evolving small-world networks with geographical attachment preference
• Better Synchronizability Predicted by Crossed Double Cycle
• Integer Networks
• Smallest small-world network
• Scaling Invariance in Spectra of Complex Networks: A Diffusion Factorial Moment Approach
• Transport properties of the hierarchical model for stretched polymers

Cited by in corpus (27)

• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• Exact calculations of first-passage quantities on recursive networks
• Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
• Exact analytical solution of average path length for Apollonian networks
• Symmetry based Structure Entropy of Complex Networks
• Random Sierpinski network with scale-free small-world and modular structure
• Mean first-passage time for random walks on the T-graph
• Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
• Fractal scale-free networks resistant to disease spread
• Average distance in a hierarchical scale-free network: an exact solution
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Anomalous behavior of trapping on a fractal scale-free network
• Topologies and Laplacian spectra of a deterministic uniform recursive tree
• Multifractal Characterization of Protein Contact Networks
• Reentrant and Forward Phase Diagrams of the Anisotropic Three-Dimensional Ising Spin Glass
• Recursive weighted treelike networks
• Transition from fractal to non-fractal scalings in growing scale-free networks
• A geometric growth model interpolating between regular and small-world networks
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• Quantum-Mechanically Induced Asymmetry in the Phase Diagrams of Spin-Glass Systems
• From regular to growing small-world networks
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
• Maximum matchings in scale-free networks with identical degree distribution
• The rigorous solution for the average distance of a Sierpinski network
• An alternative approach to determining average distance in a class of scale-free modular networks
• Spectra, hitting times, and resistance distances of $q$-subdivision graphs
• The Role of Fractal Dimension in Wireless Mesh Network Performance