The hitting and cover times of random walks on finite graphs using local degree information
Authors:
- 1 January 2009
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 410 (1) , 94-100
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Self-avoiding walks on scale-free networksPhysical Review E, 2005
- Impact of Local Topological Information on Random Walks on Finite GraphsLecture Notes in Computer Science, 2003
- On the Cover Time for Random Walks on Random GraphsCombinatorics, Probability and Computing, 1998
- A tight lower bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- A tight upper bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- Collisions Among Random Walks on a GraphSIAM Journal on Discrete Mathematics, 1993
- On a Result of Aleliunas et al. Concerning Random Walks on GraphsProbability in the Engineering and Informational Sciences, 1990
- Maximum hitting time for random walks on graphsRandom Structures & Algorithms, 1990
- Covering Problems for Markov ChainsThe Annals of Probability, 1988
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983