The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Diameter of a Scale-Free Random Graph
Combinatorica
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Could any graph be turned into a small-world?
Theoretical Computer Science - Complex networks
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Evolution of Networks: From Biological Nets to the Internet and WWW (Physics)
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Networks Become Navigable as Nodes Move and Forget
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Tight lower bounds for greedy routing in uniform small world rings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Decentralized search in networks using homophily and degree disparity
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Generalizing Kronecker graphs in order to model searchable networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Milgram-routing in social networks
Proceedings of the 20th international conference on World wide web
| Hi-index | 0.02 |
We analyze decentralized routing in small-world networks that combine a wide variation in node degrees with a notion of spatial embedding. Specifically, we consider a variation of Kleinberg's augmented-lattice model (STOC 2000), where the number of long-range contacts for each node is drawn from a power-law distribution. This model is motivated by the experimental observation that many "real-world" networks have power-law degrees. In such networks, the exponent α of the power law is typically between 2 and 3. We prove that, in our model, for this range of values, 2 α-1 n) steps. This bound is tight in a strong sense. Indeed, we prove that the expected number of steps of greedy routing for a uniformly-random pair of source-target nodes is Ω(logα-1 n) steps. We also show that for α 2 n) xexpected steps, and for α = 2, Θ(log1+ε n) expected steps are required, where 1/3 ≤ ε ≤ 1/2. To the best of our knowledge, these results are the first to formally quantify the effect of the power-law degree distribution on the navigability of small worlds. Moreover, they show that this effect is significant. In particular, as α approaches 2 from above, the expected number of steps of greedy routing in the augmented lattice with power-law degrees approaches the square-root of the expected number of steps of greedy routing in the augmented lattice with fixed degrees, although both networks have the same average degree.