Impact of local topological information on random walks on finite graphs

Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)


It is just amazing that both of the mean hitting time and the cover time of a random walk on a finite graph, in which the vertex visited next is selected from the adjacent vertices at random with the same probability, are bounded by O(n3) for any undirected graph with order n, despite of the lack of global topological information. Thus a natural guess is that a better transition matrix is designable if more topological information is available. For any undirected connected graph G = (V, E), let P(β) = (puv(β))u,v∈V be a transition matrix defined by (Equation Presented) where β is a real number, N(u) is the set of vertices adjacent to a vertex u, deg(u) = |N(u)|, and U(·, ·) is a potential function defined as U(u, v) - log (max {deg(u), deg(v)}) for it u ∈ V, v ∈ N(u). In this paper, we show that for any undirected graph with order n, the cover time and the mean hitting time with respect to P(1) are bounded by O(n2log n) and O(n2), respectively. We further show that P(1) is best possible with respect to the mean hitting time, in the sense that the mean hitting time of a path graph of order n, with respect to any transition matrix, is Ω(n2).

Original languageEnglish
Pages (from-to)1054-1067
Number of pages14
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication statusPublished - Dec 1 2003

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Impact of local topological information on random walks on finite graphs'. Together they form a unique fingerprint.

Cite this