arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0103016cs.NIcond-mat.dis-nncond-mat.stat-mechcs.PF
收藏

在幂律网络中搜索

Search in Power-Law Networks

L. A. Adamic, R. M. Lukose, A. R. Puniyani, B. A. Huberman

摘要:

许多通信和社交网络具有幂律链路分布,包含具有非常高度的少数节点和具有低度的许多节点。高连通性节点在通信和网络中扮演着枢纽的重要角色,这一事实可以在设计有效的搜索算法时加以利用。我们引入了一些本地的搜索策略,利用高度节点的幂律图,并具有成本的规模与图的大小呈次线性。我们还展示了Gnutella对等网络上这些策略的实用性。

英文摘要:

Many communication and social networks have power-law link distributions, containing a few nodes which 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 which can be exploited when designing efficient search algorithms. We introduce a number of local search strategies which utilize high degree nodes in power-law graphs and which have costs which scale sub-linearly with the size of the graph. We also demonstrate the utility of these strategies on the Gnutella peer-to-peer network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑