Fast random walks on finite graphs and graph topological information

Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
Pages360-363
Number of pages4
DOIs
Publication statusPublished - Dec 1 2011
Event2nd International Conference on Networking and Computing, ICNC 2011 - Osaka, Japan
Duration: Nov 30 2011Dec 2 2011

Publication series

NameProceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011

Other

Other2nd International Conference on Networking and Computing, ICNC 2011
CountryJapan
CityOsaka
Period11/30/1112/2/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Ono, H. (2011). Fast random walks on finite graphs and graph topological information. In 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

Fast random walks on finite graphs and graph topological information. / Ono, Hirotaka.

Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 360-363 6131864 (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ono, H 2011, Fast random walks on finite graphs and graph topological information. in Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011., 6131864, Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011, pp. 360-363, 2nd International Conference on Networking and Computing, ICNC 2011, Osaka, Japan, 11/30/11. https://doi.org/10.1109/ICNC.2011.70
Ono H. Fast random walks on finite graphs and graph topological information. In Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. p. 360-363. 6131864. (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011). https://doi.org/10.1109/ICNC.2011.70
Ono, Hirotaka. / Fast random walks on finite graphs and graph topological information. Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011. 2011. pp. 360-363 (Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011).
@inproceedings{e429d022c5a84677852a0424ced2d322,
title = "Fast random walks on finite graphs and graph topological information",
abstract = "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.",
author = "Hirotaka Ono",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ICNC.2011.70",
language = "English",
isbn = "9780769545691",
series = "Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011",
pages = "360--363",
booktitle = "Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011",

}

TY - GEN

T1 - Fast random walks on finite graphs and graph topological information

AU - Ono, Hirotaka

PY - 2011/12/1

Y1 - 2011/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84856851377&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856851377&partnerID=8YFLogxK

U2 - 10.1109/ICNC.2011.70

DO - 10.1109/ICNC.2011.70

M3 - Conference contribution

AN - SCOPUS:84856851377

SN - 9780769545691

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

SP - 360

EP - 363

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

ER -