Kleinberg Navigation in Fractal Small World Networks
arXiv:cond-mat/0612326 · doi:10.1103/PhysRevE.74.017101
Abstract
We study the Kleinberg problem of navigation in Small World networks when the underlying lattice is a fractal consisting of N>>1 nodes. Our extensive numerical simulations confirm the prediction that most efficient navigation is attained when the length r of long-range links is taken from the distribution P(r)~r^{-alpha}, where alpha=d_f, the fractal dimension of the underlying lattice. We find finite-size corrections to the exponent alpha, proportional to 1/(ln N)^2.
Cited by in corpus (22)
- Spatial Networks
- Designing optimal transport networks
- Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
- Structural properties of spatially embedded networks
- Exact solution of mean geodesic distance for Vicsek fractals
- Asymptotic behavior of the Kleinberg model
- Complex networks embedded in space: Dimension and scaling relations between mass, topological distance and Euclidean distance
- Nonlocal PageRank
- Exact Solution for Optimal Navigation with Total Cost Restriction
- Robustness of Spatial Micronetworks
- Transitions in spatial networks
- Model for the growth of the World Airline Network
- Dynamics on Spatial Networks and the Effect of Distance Coarse Graining
- On the decentralized navigation of multiple packages on transportation networks
- Greedy Connectivity of Geographically Embedded Graphs
- Modeling spatial social complex networks for dynamical processes
- A transition from river networks to scale-free networks
- Solvable Metric Growing Networks
- Maximizing Entropy Yields Spatial Scaling in Social Networks
- Cost of material or information flow in complex transportation networks
- Kleinberg navigation on anisotropic lattices
- Navigation in non-uniform density social networks