Digitale Medien
Springer
Journal of theoretical probability
2 (1989), S. 121-128
ISSN:
1572-9230
Schlagwort(e):
Random walks
;
cover times
;
graphs
;
infinite graphs
;
trees
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n 2) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of Ω(n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01048274
Permalink
|
Standort |
Signatur |
Erwartet |
Verfügbarkeit |
