Generating random elements of a finite group
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 23 (13) , 4931-4948
Abstract
We present a "Practical" algorithm to construct random elements of a finite group. We analyse its theoretical behaviour and prove that asymptotically it produces uniformly distributed tuples of elements. We discuss tests to assess its effectiveness and use these to decide when its results are acceptable for some matrix groups.Keywords
This publication has 10 references indexed in Scilit:
- Moderate growth and random walk on finite groupsGeometric and Functional Analysis, 1994
- Comparison Techniques for Random Walk on Finite GroupsThe Annals of Probability, 1993
- Deciding finiteness of matrix groups in deterministic polynomial time1993
- A Recognition Algorithm for Special Linear GroupsProceedings of the London Mathematical Society, 1992
- An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear GroupsExperimental Mathematics, 1992
- Random Number Generation and Quasi-Monte Carlo Methods1992
- Local expansion of vertex-transitive graphs and random generation in finite groups1991
- The probability of generating a finite classical groupGeometriae Dedicata, 1990
- The Subgroup Structure of the Finite Classical Groups1990
- On the maximal subgroups of the finite classical groupsInventiones Mathematicae, 1984