RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
From MaRDI portal
Publication:3520365
DOI10.1142/S0218196708004482zbMath1193.05017arXiv0707.3185MaRDI QIDQ3520365
Cyril Nicaud, Frédérique Bassino, Pascal Weil
Publication date: 26 August 2008
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.3185
Graph theory (including graph drawing) in computer science (68R10) Free nonabelian groups (20E05) Asymptotic enumeration (05A16) Probabilistic methods in group theory (20P05)
Related Items
Subset currents on free groups. ⋮ Freiheitssatz and phase transition for the density model of random groups ⋮ Generic properties of subgroups of free groups and finite presentations ⋮ Statistical properties of subgroups of free groups ⋮ A list of applications of Stallings automata ⋮ Realizable ranks of joins and intersections of subgroups in free groups ⋮ Statistics of subgroups of the modular group
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average-case complexity and decision problems in group theory.
- Topology of finite graphs
- Uniform random generation of decomposable structures using floating-point arithmetic
- A calculus for the random generation of labelled combinatorial structures
- Generic-case complexity, decision problems in group theory, and random walks.
- Stallings foldings and subgroups of free groups
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- Asymptotic Methods in Enumeration
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
- Malnormality is undecidable in hyperbolic groups