Walks on generating sets of groups

DOI10.1007/s002220050265zbMath0921.60003OpenAlexW1991127083MaRDI 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

zbMATH Keywords

rate of convergenceMarkov chainconvergence to equilibriumgenerator of a groupCeller algorithm

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Convergence of probability measures (60B10)

Related Items

Finite covers of random 3-manifolds, Generating sets of finite groups, Minimal generating sets of maximal size in finite monolithic groups., Random walks and approximate integration on compact homogeneous spaces, The maximal size of a minimal generating set, Comparison theory for Markov chains on different state spaces and application to random walk on derangements, Random generation of finite and profinite groups and group enumeration., A spectral characterization for concentration of the cover time, The product replacement algorithm and Kazhdan’s property (T), Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture, Expander graphs in pure and applied mathematics, Cutoff for product replacement on finite groups, Maximal independent generating sets of the symmetric group