Threshold limits for cover times |
| |
| Authors: | David J. Aldous |
| |
| Affiliation: | (1) Department of Statistics, University of California, 94720 Berkeley, California |
| |
| 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. |
| |
| Keywords: | Cover time Markov chain random walk on graph threshold limit |
| 本文献已被 SpringerLink 等数据库收录！ |
|
