Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Collisions among random walks on a graph
SIAM Journal on Discrete Mathematics
Randomized algorithms
A tight lower bound on the cover time for random walks on graphs
Random Structures & Algorithms
IEEE Transactions on Parallel and Distributed Systems
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The hitting and cover times of random walks on finite graphs using local degree information
Theoretical Computer Science
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Note: The hitting and cover times of Metropolis walks
Theoretical Computer Science
How to design a linear cover time random walk on a finite graph
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Speeding up random walks with neighborhood exploration
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Second order centrality: Distributed assessment of nodes criticity in complex networks
Computer Communications
Tight bounds for the cover time of multiple random walks
Theoretical Computer Science
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 fast algorithm to find all high degree vertices in power law graphs
Proceedings of the 21st international conference companion on World Wide Web
A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
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
Hi-index | 0.00 |
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 puvβ = exp [-βU(u, v)]/Σw∈N(u) exp [-βU(u, w)] for u∈V, v∈N(u), 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(n2 log 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).