Random walks on highly symmetric graphs
- 1 October 1990
- journal article
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 3 (4), 497-514
- https://doi.org/10.1007/bf01046092
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Hitting times for random walks on vertex-transitive graphsMathematical Proceedings of the Cambridge Philosophical Society, 1989
- Some sample path properties of a random walk on the cubeJournal of Theoretical Probability, 1989
- Lower bounds for covering times for reversible Markov chains and random walks on graphsJournal of Theoretical Probability, 1989
- Covering Problems for Markov ChainsThe Annals of Probability, 1988
- Covering Problems for Brownian Motion on SpheresThe Annals of Probability, 1988
- Orthogonal Polynomials and Chevalley GroupsPublished by Springer Nature ,1984
- Minimization Algorithms and Random Walk on the $d$-CubeThe Annals of Probability, 1983
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983
- Random walks on finite groups and rapidly mixing markov chainsPublished by Springer Nature ,1983
- Some Extremal Markov ChainsBell System Technical Journal, 1982