Walks on generating sets of groups
- Cite this article as:
- Diaconis, P. & Saloff-Coste, L. Invent math (1998) 134: 251. doi:10.1007/s002220050265
- 95 Downloads
We study a Markov chain on generating n-tuples of a fixed group which arises in algorithms for manipulating finite groups. The main tools are comparison of two Markov chains on different but related state spaces and combinatorics of random paths. The results involve group theoretical parameters such as the size of minimal generating sets, the number of distinct generating k-tuples for different k's and the maximal diameter of the group.