Abstract
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(n 3) 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(β) = (p (β)uv )u,v∈V be a transition matrix defined by
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 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(n 2 log n) and O(n 2), 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 Ω (n 2).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.J. Aldous, “On the time taken by random walks on finite groups to visit every state”, Z.Wahrsch. verw. Gebiete 62 361–393, 1983.
R. Aleliunas, R.M Karp, R.J. Lipton, L. Lovász, and C. Rackoff, “Random walks, universal traversal sequences, and the complexity of maze problems”, Proc. 20th Ann. Symposium on Foundations of Computer Science, 218–223, 1979.
G. Blom, L. Holst, and D. Sandell, “Problems and Snapshots from the World of Probability”, Springer-Verlag, New York, NY, 1994.
G. Brightwell and P. Winkler, “Maximum hitting time for random walks on graphs”, J. Random Structures and Algorithms, 3, 263–276, 1990.
A.Z. Broder and Karlin, “Bounds on covering times”, In 29th Annual Symposium on Foundations of Computer science, 479–487, 1988.
D. Coppersmith, P. Tetali, and P. Winkler, “Collisions among random walks on a graph”, SIAM Journal on Discrete Mathematics, 6,3, 363–374, 1993.
U. Feige, “A tight upper bound on the cover time for random walks on graphs,” J. Random Structures and Algorithms, 6,4, 433–438, 1995.
S. Ikeda, I. Kubo, N. Okumoto and M. Yamashita, “Fair circulation of a token,” IEEE Trans. Parallel and Distributed Systems, Vol.13, No.4, 367–372, 2002.
L. Isaacson and W. Madsen, “Markov chains: Theory and Application”, Wiley series in probability and mathematical statistics, New York, 1976.
A. Israeli and M. Jalfon, “Token management schemes and random walks yield self stabilizing mutual exclusion”, Proc. of the 9th ACM Symposium on Principles of Distributed Computing, 119–131, 1990.
P. Matthews, “Covering Problems for Markov Chain”, The Annals of Probability Vol.16, No.3, 1215–1228, 1988.
R. Motowani and P. Raghavan, “Randomized Algorithms”, Cambridge University Press, New York, 1995.
N. Okumoto, “ A study on random walks of tokens on graphs ”, M.E.Thesis, Hiroshima Univ., Higashi-Hiroshima, Japan, 1996.
J.L. Palacios, “On a result of Aleiliunas et al. concerning random walk on graphs,” Probability in the Engineering and Informational Sciences, 4, 489–492, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikeda, S., Kubo, I., Okumoto, N., Yamashita, M. (2003). Impact of Local Topological Information on Random Walks on Finite Graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_81
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive