Random Sampling of Trivial Words in Finitely Presented Groups
DOI10.1080/10586458.2015.1005853zbMath1355.20038arXiv1312.5722OpenAlexW1925064485MaRDI QIDQ3194576
Andrew Rechnitzer, E. J. Janse van Rensburg, Murray J. Elder
Publication date: 20 October 2015
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.5722
spectral radiusamenable groupBaumslag-Solitar groupcogrowthmetropolis algorithmR. Thompson's group \(F\)
Exact enumeration problems, generating functions (05A15) Geometric group theory (20F65) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Asymptotic properties of groups (20F69)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Fast growth in the Følner function for Thompson's group \(F\).
- Amenability via random walks.
- Testing Cayley graph densities.
- Cogrowth of groups and simple random walks
- Cogrowth and amenability of discrete groups
- Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
- Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\).
- On the cogrowth of Thompson's group F
- FOREST DIAGRAMS FOR ELEMENTS OF THOMPSON'S GROUP F
- A First Look at Rigorous Probability Theory
- Monte Carlo methods for the self-avoiding walk
- On rationality of the cogrowth series
- Cogrowth series of free products of finite and free groups
- ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
- A computational approach to the Thompson group F
- The cogrowth series for BS(N, N) is D-finite
- Probability and Computing
This page was built for publication: Random Sampling of Trivial Words in Finitely Presented Groups
