On the time taken by random walks on finite groups to visit every state
- 1 January 1983
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 62 (3) , 361-374
- https://doi.org/10.1007/bf00535260
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Minimization Algorithms and Random Walk on the $d$-CubeThe Annals of Probability, 1983
- Markov chains with almost exponential hitting timesStochastic Processes and their Applications, 1982