Impact of Local Topological Information on Random Walks on Finite Graphs
Authors:
- 18 June 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 1054-1067
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fair circulation of a tokenIEEE Transactions on Parallel and Distributed Systems, 2002
- Randomized Algorithms1995
- A tight lower bound on the cover time for random walks on graphsRandom Structures & Algorithms, 1995
- Problems and Snapshots from the World of Probability1994
- 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
- Token management schemes and random walks yield self-stabilizing mutual exclusion1990
- 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