On a variant of the product replacement algorithm
Glasgow mathematical journal, Tome 66 (2024) no. 1, pp. 221-228
Voir la notice de l'article provenant de la source Cambridge
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.
Mots-clés :
Product replacement, Random group elements, Rattle, Markov Processes
Leedham-Green, C.R. On a variant of the product replacement algorithm. Glasgow mathematical journal, Tome 66 (2024) no. 1, pp. 221-228. doi: 10.1017/S0017089523000435
@article{10_1017_S0017089523000435,
author = {Leedham-Green, C.R.},
title = {On a variant of the product replacement algorithm},
journal = {Glasgow mathematical journal},
pages = {221--228},
year = {2024},
volume = {66},
number = {1},
doi = {10.1017/S0017089523000435},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089523000435/}
}
TY - JOUR AU - Leedham-Green, C.R. TI - On a variant of the product replacement algorithm JO - Glasgow mathematical journal PY - 2024 SP - 221 EP - 228 VL - 66 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.1017/S0017089523000435/ DO - 10.1017/S0017089523000435 ID - 10_1017_S0017089523000435 ER -
Cité par Sources :