Random walks on finite groups

From MaRDI portal





The author presents a survey on random walks on finite groups, an area of research which was very active during the last decade. In fact, the emphasis of this article is laid on quantitative results, in particular on rates of convergence to uniform distribution. Of course, in a survey most proofs have to be omitted, the author explains the results and their importance by concrete examples, the most prominent are card shuffling problems. The paper is divided into ten sections. The titles may serve as a list of contents: Introduction; Background and notations (including general Markov chain techniques); Shuffling cards and cut-off phenomenon; Probabilistic methods; Spectrum and singular values (eigenvalue bounds for general Markov chains and in particular for random walks); Eigenvalue bounds using paths (i.e., paths in the corresponding Caley graph); Volume growth conditions; Representation theory for finite groups (and rates for convergence to the uniform distribution); comparsion techniques (comparsion of two random walks via corresponding Dirichlet forms). An introduction to this field and a first survey reflecting the investigations up to 1988 is found in the stimulating booklet of \textit{P. Diaconis} [``Group representations in probability and statistics (1988; Zbl 0695.60012)]. In the present survey the list of references contains 146 items, showing the activity of the research field. It should be noted that many important contributions of the last decade are due to the author and to P. Diaconis. For the entire collection see [Zbl 1025.60001].




Cited in
(only showing first 100 items - show all)








This page was built for publication: Random walks on finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450069)