Deterministic approximation of the cover time
Random Structures & Algorithms
Algorithmic Aspects of a Chip-Firing Game
Combinatorics, Probability and Computing
New bounds for randomized busing
Theoretical Computer Science
Efficiency of random walks for search in different network structures
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Efficiency of Search Methods in Dynamic Wireless Networks
Wireless Systems and Mobility in Next Generation Internet
A Term-Based Driven Clustering Approach for Name Disambiguation
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
DepRank: A Probabilistic Measure of Dependence via Heterogeneous Links
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
A new method to automatically compute processing times for random walks based distributed algorithms
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy-to-compute graph properties. Namely, for any connected graph, the cyclic cover time is $\Theta(n^2 d_{ave} (d^{-1})_{ave})$, where $n$ is the number of vertices in the graph, $d_{ave}$ is the average degree of its vertices, and $(d^{-1})_{ave}$ is the average of the inverse of the degree of its vertices. Other results obtained in the processes of proving the main theorem are a similar characterization of minimum resistance spanning trees of graphs, improved bounds on the cover time of graphs, and a simplified proof that the maximum commute time in any connected graph is at most $4n^3/27 + o(n^3)$.