No CrossRef data available.
Article contents
On a variant of the product replacement algorithm
Published online by Cambridge University Press: 09 January 2024
Abstract
We discuss a variant, named ‘Rattle’, of the product replacement algorithm. Rattle is a Markov chain, that returns a random element of a black box group. The limiting distribution of the element returned is the uniform distribution. We prove that, if the generating sequence is long enough, the probability distribution of the element returned converges unexpectedly quickly to the uniform distribution.
MSC classification
- Type
- Research Article
- Information
- Copyright
- © The Author(s), 2024. Published by Cambridge University Press on behalf of Glasgow Mathematical Journal Trust
References
Babai, L., Local expansion of vertex-transitive graphs and random generation in finite groups, in Proceedings of 23rd ACM STOC (1991), 164–174.CrossRefGoogle Scholar
Babai, L. and Pak, I., Strong bias of group generators: an obstacle to the “product replacement algorithm, J. Algorithms 50(2) (2004), 215–231.CrossRefGoogle Scholar
Biswas, A., On a Cheeger type inequality in Cayley graphs of finite groups, Eur. J. Comb. 81 (2019), 298–308.CrossRefGoogle Scholar
Breuillard, E., Green, B., Guralnik, R. and Tao, T., Expansion in finite simple Groups of Lie type arXiv:1390.1975 (2014).Google Scholar
Bäärnhielm, H. and Leedham-Green, C. R., The product replacement prospector, J. Symb. Comput. 47(1) (2012), 64–75.CrossRefGoogle Scholar
Celler, F., Leedham-Green, C. R., Murray, S. H., Niemeyer, A. C. and O’Brien, E. A., Generating random elements of a finite group, Commun. Algebra 23(13) (1995), 4931–4948.CrossRefGoogle Scholar
Detomi, E., Lucchini, A. and Morigi, M., The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups, J. Algebra 468 (2006), 49–71.CrossRefGoogle Scholar
Kaluba, M., Kielak, D. and Nowak, P.,
On property
$(T)$
for
$\mathrm{Aut}({\mathbb F}_n)$
and
$\mathrm{SL}_n({\mathbb Z})$
. arXiv:1812.03456.Google Scholar
$(T)$
for
$\mathrm{Aut}({\mathbb F}_n)$
and
$\mathrm{SL}_n({\mathbb Z})$
. arXiv:1812.03456.Google ScholarKaluba, M., Nowak, P. W. and Ozawa, N., Aut (F5) has property
$(T)$
arXiv: 1712.07167.Google Scholar
$(T)$
arXiv: 1712.07167.Google ScholarLeedham-Green, C., The computational matrix group project, in Groups and computation III (de Gruyter, New York, Ohio) (1999), 229–248.Google Scholar
Leedham-Green, C. and Murray, S., Variants of product replacement, in Computational and statistical group theory, Contemporary Mathematics, vol. 298 (American Mathematical Society, Providence, RI, 2001), 97–104.CrossRefGoogle Scholar
Levin, D. A., Peres, Y. and Wilmer, E. L., Markov chains and mixing times, 2nd edition (American Mathematical Society, Providence, Rhode Island, 2017).CrossRefGoogle Scholar
Lubotzky, A., The expected number of random elements to generate a finite group, J. Alg. 257 (2002), 452–459.CrossRefGoogle Scholar
Lubotzky, A. and Pak, I., The product replacement algorithm and Kazhdan’s property (T), J.A.M.S. 14(2) (2001), 347–363.Google Scholar
O’Brien, E., Towards effective algorithms for linear groups, in Finite geometries, groups and computation, (Colorado), September 2004 (2006), 163–190.Google Scholar
Pak, I., What do we know about the product replacement algorithm?, in Groups and computation III (Ohio State University Mathematical Research Institute Publications, de Gruyter, Ohio, Berlin) (1999), 301–347.Google Scholar
Pak, I., The product replacement algorithm is polynomial, in Proceedings 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA (2000), 476–485.Google Scholar
Peres, Y., Tanaka, R. and Zhai, A., Cutoff for product replacement on finite groups, in Probability and related fields (2020).Google Scholar