A. Condon and D. Hernek. Random walks on colored graphs. Random Struct. Alg., 5:285--303, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cover Times - Aldous, Fill (1994) (Correct)
....for a more careful discussion of the issues. The alert reader of our example will have noticed the subtle implication that the reader 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 is prespecified and the random walk at step t picks an edge uniformly at random from the color c t edges at the current vertex. ....
A. Condon and D. Hernek. Random walks on colored graphs. Random Struct. Alg., 5:285--303, 1994.
Random Walks on Colored Graphs: Analysis and Applications - Hernek (1995) (1 citation) Self-citation (Hernek) (Correct)
....of random walks on colored graphs, such as expected cover time, as well as applications in computational complexity, where there are direct applications to 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 graph G is the number of steps until a random walk visits all of the vertices of G, as a worst case over all starting vertices and infinite color sequences. We ....
A. Condon and D. Hernek. Random walks on colored graphs. In Proc. 2nd Israel Symposium on Theory and Computing Systems, pages 134--140, 1993.
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