David Zuckerman  Home/Search
Context Related
| utexas.edu/users/diz/edge.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu/users/diz/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The expected time for a random walk on an undirected graph G = (V; E) to visit all the vertices is O(jV jjEj) [AKLLR], and is O(jV j 2 ) for regular graphs [KLNS]. Here we show that both bounds hold even if we are required to traverse all the edges, although our bound for regular graphs requires that the degree be jV j ffi for some ffi ! 1. Keywords: random walk, cover time, combinatorial problems 1 Introduction A random walk on an undirected graph is the sequence of vertices visited by a ... (Update)
Context of citations to this paper: More
...(as happens on the barbell) There are a number of variations on the theme of Theorem 1, and we will give two. The first (due to Zuckerman [30], whose proof we follow) provides a nice illustration of probabilistic technique. Proposition 3 Write C e for the time to cover all...
Cited by: More
Cover Times - Aldous, Fill (1994) (Correct)
Active bibliography (related documents): More All
1.1: A Technique for Lower Bounding the Cover Time - Zuckerman (1992) (Correct)
0.6: Multiple Cover Time - Winkler, Zuckerman (Correct)
0.3: Confirming Kleitman-Winston Conjecture ON THE LARGEST.. - Kim, Pittel (1999) (Correct)
Similar documents based on text: More All
0.4: On Cycle Means and Cyclic Staffing - Mark Hartmann Department (Correct)
0.0: A Spectrum of Time-Space Tradeoffs for Undirected s-t Connectivity - Feige (1996) (Correct)
0.0: An Improved Subspace Identification Method for Bilinear Systems - Chen, Maciejowski (Correct)
BibTeX entry: (Update)
D. Zuckerman. On the time to traverse all edges in a graph. Information Proc. Letters., 38:335--337, 1991. http://citeseer.ist.psu.edu/zuckerman97time.html More
@article{ zuckerman91time,
author = "David Zuckerman",
title = "On the Time to Traverse all Edges of a Graph",
journal = "Information Processing Letters",
volume = "38",
number = "6",
pages = "335-337",
year = "1991",
url = "citeseer.ist.psu.edu/zuckerman97time.html" }
Citations (may not include all citations):23 Covering problems for Brownian motion on spheres (context) - Matthews - 1988
20 the cover time of random walks in graphs (context) - Kahn, Linial et al. - 1989
12 A technique for lower bounding the cover time - Zuckerman - 1990
11 Lower bounds for covering times for reversible Markov chains.. (context) - Aldous - 1989
8 the time taken by random walks on finite groups to visit eve.. (context) - Aldous - 1983
3 Bounds on covering times (context) - Broder, Karlin - 1989
3 Cole Advanced Books & Software (context) - Durrett, Theory et al. - 1991
2 th Annual IEEE Symposium on Foundations of Computer Science (context) - Aleliunas, Karp et al. - 1979
Documents on the same site (http://www.cs.utexas.edu/users/diz/pubs.html): More
Lower Bounds for Leader Election and Collective.. - Russell, Saks, Zuckerman (1999) (Correct)
Security Preserving Amplification of Hardness - Goldreich, Impagliazzo.. (1990) (Correct)
Lower Bounds for Randomized Mutual Exclusion - Kushilevitz, Mansour, Rabin.. (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC