What do we know about the product replacement algorithm?
From MaRDI portal
Recommendations
- The product replacement prospector.
- scientific article; zbMATH DE number 1445359
- The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups
- Strong bias of group generators: an obstacle to the “product replacement algorithm”
- Generating random elements of a finite group
Cited in
(37)- The Markoff group of transformations in prime and composite moduli. With an appendix by Dan Carmon.
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- Moduli interpretations for noncongruence modular curves
- Recognising tensor-induced matrix groups.
- Accelerating abelian random walks with hyperbolic dynamics
- Tamely ramified covers of the projective line with alternating and symmetric monodromy
- Hit and run as a unifying device
- Algorithmic search in group theory
- Application of character estimates to the number of \(\mathrm{T}_2\)-systems of the alternating group
- The spread of a finite group
- The product replacement algorithm and Kazhdan's property (T)
- Probabilistic and asymptotic aspects of finite simple groups.
- The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups
- Commutator maps, measure preservation, and 𝑇-systems
- Connectivity of the product replacement algorithm graph of PSL(2, q)
- The Markov chain Monte Carlo revolution
- Minimal generating sets of maximal size in finite monolithic groups.
- On the Abelianizations of congruence subgroups of \(\Aut(F_2)\).
- On Andrews-Curtis conjectures for soluble groups
- On a question of B. H. Neumann
- Product Replacement in the Monster
- Strong bias of group generators: an obstacle to the “product replacement algorithm”
- Bias of group generators in the solvable case.
- Nielsen equivalence in Gupta-Sidki groups
- Bias of group generators in finite and profinite groups: known results and open problems
- Strong uniform expansion in \(\text{SL}(2,p)\).
- On a variant of the product replacement algorithm
- Nonabelian level structures, Nielsen equivalence, and Markoff triples
- Random generation of finite and profinite groups and group enumeration.
- The product replacement prospector.
- Finite simple characteristic quotients of the free group of rank 2
- Lifting generators in connected Lie groups
- Decomposing homogeneous modules of finite groups in characteristic zero.
- Maximal subgroups of finite soluble groups in general position
- Cutoff for product replacement on finite groups
- Finite covers of random 3-manifolds
- Connectivity of the product replacement graph of simple groups of bounded Lie rank.
This page was built for publication: What do we know about the product replacement algorithm?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2759638)
