Constrained spin dynamics description of random walks on hierarchical scale-free networks

Abstract

We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule, which allows an analytic approach. We show analytically that the characteristic relaxation time scale grows algebraically with the total number of nodes $N$ as $T\sim N^z$. From a scaling argument, we also show the power-law decay of the autocorrelation function $C_{\bfsigma}(t)\sim t^{-α}$, which is the probability to find the Ising spins in the initial state ${\bfsigma}$ after $t$ time steps, with the state-dependent non-universal exponent $\alpha$. It turns out that the power-law scaling behavior has its origin in an quasi-ultrametric structure of the configuration space.

9 pages, 6 figures

References in corpus (20)

• Statistical mechanics of complex networks
• Epidemic spreading in scale-free networks
• The diameter of the world wide web
• Hierarchical organization of modularity in metabolic networks
• Evolution of networks
• Hierarchical Organization in Complex Networks
• Search in Power-Law Networks
• Glassy dynamics of kinetically constrained models
• Pseudofractal Scale-free Web
• Ising Model on Networks with an Arbitrary Distribution of Connections
• Distance, dissimilarity index, and network community structure
• A Geometric Fractal Growth Model for Scale Free Networks
• First- and second-order phase transitions in scale-free networks
• Relaxation Properties of Small-World Networks
• Random spread on the family of small-world networks
• Scaling Properties of Random Walks on Small-World Networks
• Exact scaling properties of a hierarchical network model
• Random walks on fractals and stretched exponential relaxation
• Adaptive Random Walks on the Class of Web Graph
• Scaling of random spreading in small world networks

Cited by in corpus (17)

• Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
• Exploring Complex Networks through Random Walks
• Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
• Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
• Stationary and dynamical properties of a zero range process on scale-free networks
• Trapping in scale-free networks with hierarchical organization of modularity
• 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
• Walks on weighted networks
• Learning about knowledge: A complex network approach
• Epidemic Variability in Hierarchical Geographical Networks with Human Activity Patterns
• Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks
• Minimal models of weighted scale-free networks
• Random walks in small-world exponential treelike 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