Spectral dimensions of hierarchical scale-free networks with shortcuts
arXiv:1006.4005 · doi:10.1103/PhysRevE.82.056110
Abstract
The spectral dimension has been widely used to understand transport properties on regular and fractal lattices. Nevertheless, it has been little studied for complex networks such as scale-free and small world networks. Here we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractals or non-fractals depending on the weight of shortcuts. Applying the renormalization group (RG) approach to the Gaussian model, we obtain the spectral dimension exactly. While the spectral dimension varies between and for the fractal case, it remains at , independent of the variation of network structure for the non-fractal case. The crossover behavior between the two cases is studied through the RG flow analysis. The analytic results are confirmed by simulation results and their implications for the architecture of complex systems are discussed.
arXiv comment10 pages, 3 figures
References in corpus (25)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Evolution of networks
- Self-similarity of complex networks
- First-passage times in complex scale-invariant media
- Origins of fractality in the growth of complex networks
- Skeleton and fractal scaling in complex networks
- Fractal and Transfractal Recursive Scale-Free Nets
- Global mean first-passage times of random walks on complex networks
- Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
- Transport in weighted networks: Partition into superhighways and roads
- Inverted Berezinskii-Kosterlitz-Thouless Singularity and High-Temperature Algebraic Order in an Ising Model on a Scale-Free Hierarchical-Lattice Small-World Network
- Fractality in complex networks: critical and supercritical skeletons
- Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
- Exact solution for mean first-passage time on a pseudofractal scale-free web
- Scale-free trees: the skeletons of complex networks
- Topological Properties of Citation and Metabolic Networks
- First Passage Properties of the Erdos-Renyi Random Graph
- Percolation in Hierarchical Scale-Free Nets
- Random walks on complex trees
- Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
- Stability of shortest paths in complex networks with random edge weights
- Return times of random walk on generalized random graphs
- Random Walks on Complex Networks
- Spectral densities of scale-free networks
Cited by in corpus (15)
- First passage time for random walks in heterogeneous networks
- Simplicial complexes: higher-order spectral dimension and dynamics
- Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
- The spectral dimension of simplicial complexes: a renormalization group theory
- Multifractal analysis of weighted networks by a modified sandbox algorithm
- Scaling laws for diffusion on (trans)fractal scale-free networks
- The higher-order spectrum of simplicial complexes: a renormalization group approach
- Origin of the hub spectral dimension in scale-free networks
- Exact eigenvalue spectrum of a class of fractal scale-free networks
- Analysis of fluctuations in the first return times of random walks on regular branched networks
- Measuring the dimension of partially embedded networks
- Local topological moves determine global diffusion properties of hyperbolic higher-order networks
- Average Trapping time on the 3-dimensional 3-level Sierpinski gasket network with a set of trap nodes
- Universal scaling hypothesis of quantum spatial search in complex networks
- Deterministic simplicial complexes