Walks on generating sets of groups
From MaRDI portal
Publication:1273297
DOI10.1007/s002220050265zbMath0921.60003MaRDI QIDQ1273297
Persi Diaconis, Laurent Saloff-Coste
Publication date: 6 December 1998
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002220050265
rate of convergence; Markov chain; convergence to equilibrium; generator of a group; Celler algorithm
20F05: Generators, relations, and presentations of groups
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60B10: Convergence of probability measures
Related Items
Generating sets of finite groups, The maximal size of a minimal generating set, Minimal generating sets of maximal size in finite monolithic groups., Random walks and approximate integration on compact homogeneous spaces, Random generation of finite and profinite groups and group enumeration., Cutoff for product replacement on finite groups, Finite covers of random 3-manifolds, Comparison theory for Markov chains on different state spaces and application to random walk on derangements, Maximal independent generating sets of the symmetric group, Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture, A spectral characterization for concentration of the cover time, The product replacement algorithm and Kazhdan’s property (T), Expander graphs in pure and applied mathematics