Answers are grounded in this paper and cite their sources.
Many communication and social networks have power-law link distributions, containing a few nodes that have a very high degree and many with low degree. The high connectivity nodes play the important role of hubs in communication and networking, a fact that can be exploited when designing efficient search algorithms. We introduce a number of local search strategies that utilize high degree nodes in power-law graphs and that have costs scaling sublinearly with the size of the graph. We also demonstrate the utility of these strategies on the GNUTELLA peer-to-peer network.
No takes yet. Share an insight, caveat, or question.
Adamic et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: