A generic search strategy for large-scale real-world networks

Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 被引用数 (Scopus)

抄録

We consider the following situation for a given large-scale network: Starting from an initial node we move to its neighbor node and repeat that until reaching a target node. How fast can we do this without any global topological information? This problem is considered "searching networks", and several approaches have been proposed. In this paper, we present a general framework of search strategies, under which all of these existing approaches can be formalized. Our framework characterizes random search strategies by the following three parameters: memory for previously-visited nodes, look-ahead property and transition probability. Through computational simulations for large-scale networks with small-worldness and scale-freeness, we investigate the relationship between the effect of parameters of the strategies and the coefficients of networks such as the clustering coefficient. The comparison result provides a guideline to obtain good parameters of the strategies according to the diameter and the clustering coefficients of networks.

本文言語英語
ホスト出版物のタイトルProceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06
DOI
出版ステータス出版済み - 2006
イベント1st International Conference on Scalable Information Systems, InfoScale '06 - Hong Kong, 中国
継続期間: 5 30 20066 1 2006

出版物シリーズ

名前ACM International Conference Proceeding Series
152

その他

その他1st International Conference on Scalable Information Systems, InfoScale '06
国/地域中国
CityHong Kong
Period5/30/066/1/06

All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • 人間とコンピュータの相互作用
  • コンピュータ ビジョンおよびパターン認識
  • コンピュータ ネットワークおよび通信

フィンガープリント

「A generic search strategy for large-scale real-world networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル