Fast random walks on finite graphs and graph topological information

Hirotaka Ono

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (Scopus)

抜粋

A random walk on a graph is a process in which a particle on a vertex repeatedly moves to its adjacent vertex according to transition probability, which is given in advance. The behavior of random walks depend on its transition probability, and the ''speed'' of random walks also can be measured from several viewpoints. Among the several measures, the hitting time and the cover time are two popular ones and often used for evaluation. In this paper, we consider the speed of random walks from the viewpoint of topological information of graphs and its use. For example, it is known that a simple random walk, in which a particle moves to its adjacent vertex uniformly at random, visits all the vertices in O(n 3) expected steps (which is the cover time), while a random walk utilizing all the topological information on a graph can visit all the vertices in O(n 2) expected steps, where n is the number of vertices. In this paper, we briefly survey work focusing on the relationship between the speed of random walks on a graph and its usage of topological information.

元の言語英語
ホスト出版物のタイトルProceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
ページ360-363
ページ数4
DOI
出版物ステータス出版済み - 12 1 2011
イベント2nd International Conference on Networking and Computing, ICNC 2011 - Osaka, 日本
継続期間: 11 30 201112 2 2011

出版物シリーズ

名前Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

その他

その他2nd International Conference on Networking and Computing, ICNC 2011
日本
Osaka
期間11/30/1112/2/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

これを引用

Ono, H. (2011). Fast random walks on finite graphs and graph topological information. : Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011 (pp. 360-363). [6131864] (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011). https://doi.org/10.1109/ICNC.2011.70