Anne Condon, Diane Hernek  Home/Search
Context Related
| wisc.edu/~condon/pa...condonhernek94.ps cs.ubc.ca/spider/co...condonhernek94.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: wisc.edu/~condon/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We initiate a study of random walks on undirected graphs with colored edges. In our model, a sequence of colors is specified before the walk begins, and it dictates the color of edge to be followed at each step. We give tight upper and lower bounds on the expected cover time of a random walk on an undirected graph with colored edges. We show that, in general, graphs with two colors have exponential expected cover time, and graphs with three or more colors have doubly-exponential expected cover... (Update)
Context of citations to this paper: More
...the theory of nonhomogeneous Markov chains and coding and information theory. Many of the results have appeared in the papers [9] and [8]. We begin in Chapter 2 with an investigation of the expected cover time of random walks on colored graphs. The cover time of the colored...
...has written fewer papers than Paul Erdos, otherwise (why ) it would be preferable to do the random walk in the other direction. Miscellaneous. Condon and Hernek [14] study cover times in the following setting. The edges of a graph are colored, a sequence (c t ) of colors...
Cited by: More
Cover Times - Aldous, Fill (1994) (Correct)
Random Walks on Colored Graphs: Analysis and Applications - Hernek (1995) (Correct)
Active bibliography (related documents): More All
0.2: The Capacity Of Finite State Channels - Pfister (2003) (Correct)
0.2: Reversible Markov Chains - Aldous, Fill (1994) (Correct)
0.2: Reliable Communication Under Channel Uncertainty - Lapidoth, Narayan (1998) (Correct)
Similar documents based on text: More All
0.4: The Cover Time of Sparse Random Graphs. - Cooper, Frieze (2002) (Correct)
0.1: Asynchronously Replicated Shared Workspaces for a Multi-Media.. - Benz, Lijding (1998) (Correct)
0.1: Technical Overview of an Annotation Service for Medical .. - Benz, Fischer.. (1997) (Correct)
Related documents from co-citation: More All
2: Bounds on the cover time - Broder, Karlin - 1989
BibTeX entry: (Update)
A. Condon and D. Hernek. Random walks on colored graphs. In Proc. 2nd Israel Symposium on Theory and Computing Systems, pages 134--140, 1993. http://citeseer.ist.psu.edu/article/condon94random.html More
@inproceedings{ condon93random,
author = "Anne Condon and Diane Hernek",
title = "Random Walks on Colored Graphs",
booktitle = "Israel Symposium on Theory of Computing Systems",
pages = "134-140",
year = "1993",
url = "citeseer.ist.psu.edu/article/condon94random.html" }
Citations (may not include all citations):403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
170 Nondeterministic space is closed under complement - Immerman - 1988
168 Non-negative Matrices and Markov Chains (context) - Seneta - 1981
132 Relationships between nondeterministic and deterministic tap.. (context) - Savitch - 1970
126 Eigenvalues and expanders (context) - Alon - 1986
65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
56 Conductance and the rapid mixing property for Markov chains (context) - Jerrum, Sinclair - 1988
29 The method of forcing for nondeterministic automata (context) - Szelepcs'enyi - 1987
26 the complexity of space-bounded interactive proofs (context) - Condon, Lipton - 1989
22 Finite state verifiers I: The power of interaction (context) - Dwork, Stockmeyer - 1992
20 Bounds on the cover time - Broder, Karlin - 1989
8 Space-bounded probabilistic game automata (context) - Condon - 1991
5 Random walks on graphs (context) - Gobel, Jagers - 1974
4 Proof of Shannon's transmission theorem for finite-state ind.. (context) - Blackwell, Breiman et al. - 1958
2 Definite and quasi-definite sets of stochastic matrices (context) - Paz - 1965
1 Conductance and convergence of expanders (context) - Mihail - 1989
Documents on the same site (http://www.cs.wisc.edu/~condon/): More
On the Power of Finite Automata with both.. - Condon, Hellerstein, al. (1994) (Correct)
Complexity of Sub-Bus Mesh Computations - Condon, Ladner, Lampe, Sinha (1996) (Correct)
Interactive Proof Systems with Polynomially Bounded Strategies - Condon, Ladner (1992) (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