Electronic Resource
Springer
Journal of theoretical probability
4 (1991), S. 197-211
ISSN:
1572-9230
Keywords:
Cover time
;
Markov chain
;
random walk on graph
;
threshold limit
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Under a natural hypothesis, the cover time for a finite Markov chain can be approximated by its expectation, as the size of state space tends to infinity. This result is deduced from an abstract result concerning covering, an unstructured set by i.i.d. arbitrarily distributed random subsets.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01047002
Permalink
|
Location |
Call Number |
Expected |
Availability |