On a variant of the product replacement algorithm

DOI10.1017/s0017089523000435MaRDI QIDQ6119147

Charles R. Leedham-Green

Publication date: 29 February 2024

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

zbMATH Keywords

Markov processesproduct replacementrandom group elementsRattle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups
• The product replacement prospector.
• Cutoff for product replacement on finite groups
• The expected number of random elements to generate a finite group.
• On a Cheeger type inequality in Cayley graphs of finite groups
• The product replacement algorithm and Kazhdan’s property (T)
• Strong bias of group generators: an obstacle to the “product replacement algorithm”
• Generating random elements of a finite group

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