Search in power-law networks

Abstract

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.

Search and Congestion in Complex Networks

“…Parallel to these efforts, there have been some attempts to exploit the scale free nature of some networks to design algorithms that, being local in nature, are still quite efficient [26,27]. The idea in all these works is to profit from the scale-free nature of networks such as the Internet and bias the search towards those nodes that have a high connectivity and therefore act as hubs.…”

Statistical-mechanical iterative algorithms on complex networks

“…Therefore, one expects that highdegree nodes, so-called hubs, play important roles in the dynamics on the heterogeneous networks, and hence, one could use the heterogeneity to make efficient algorithms in a wide variety of problems. This is true in some cases, and an efficient local search algorithm has been proposed, which efficiently uses information of high-degree nodes (hubs) [15,16,17].…”

Local Information Based Algorithms for Packet Transport in Complex Networks

“…One of the most interesting dynamical problems on network is transport, which can give us some insight into the transport of information in technology based communication networks like the internet [1], the World Wide Web [2], [3] or phone call networks [4]. Here we use the term transport to mean transport of particles, which are packets in a network.…”