Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Second order centrality: Distributed assessment of nodes criticity in complex networks
Computer Communications
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Tight bounds for the cover time of multiple random walks
Theoretical Computer Science
The evolution of the cover time
Combinatorics, Probability and Computing
The cover time of cartesian product graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
A random walk topology management solution for grid
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Stationary distribution and cover time of random walks on random digraphs
Journal of Combinatorial Theory Series B
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
On electric resistances for distance-regular graphs
European Journal of Combinatorics
Exploring unknown paths in networks based on multiple random walks
IScIDE'12 Proceedings of the third Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We prove that the expected time for a random walk to cover all n vertices of a graph is at least (1 + o(1))n In n. © 1995 Wiley Periodicals, Inc.