On a variant of the product replacement algorithm

DOI10.1017/S0017089523000435MaRDI QIDQ6119147zbMATH OpenFDO

Authors C. R. Leedham-Green

Publication date 29 February 2024

Published in Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0017089523000435

zbMATH Keywords

Markov processesproduct replacementrandom group elementsRattle

Mathematics Subject Classification ID

Probabilistic methods in group theory (20P05) Markov processes: estimation; hidden Markov models (62M05)

Recommendations

• What do we know about the product replacement algorithm?
• The product replacement prospector.
• Generating random elements of a finite group
• scientific article; zbMATH DE number 1445359
• Strong bias of group generators: an obstacle to the “product replacement algorithm”

Cites work

• Cutoff for product replacement on finite groups
• Generating random elements of a finite group
• scientific article; zbMATH DE number 1836318 (Why is no real title available?)
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On a Cheeger type inequality in Cayley graphs of finite groups
• Strong bias of group generators: an obstacle to the “product replacement algorithm”
• The computational matrix group project.
• The expected number of random elements to generate a finite group.
• The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups
• The product replacement algorithm and Kazhdan's property (T)
• The product replacement prospector.
• Towards effective algorithms for linear groups.
• What do we know about the product replacement algorithm?

This page was built for publication: On a variant of the product replacement algorithm

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