Uniform rank gradient, cost, and local-global convergence
DOI10.1090/tran/8008zbMath1480.20107arXiv1710.10431OpenAlexW2997501832MaRDI QIDQ5218237
Miklós Abért, László Márton Tóth
Publication date: 2 March 2020
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10431
Generators, relations, and presentations of groups (20F05) Chains and lattices of subgroups, subnormal subgroups (20E15) Asymptotic properties of groups (20F69) Residual properties and generalizations; residually finite groups (20E26) General groups of measure-preserving transformations and dynamical systems (37A15)
Related Items (3)
Cites Work
- The rank gradient from a combinatorial viewpoint.
- Rank gradient, cost of groups and the rank versus Heegaard genus problem
- Rank, combinatorial cost, and homology torsion growth in higher rank lattices
- Expanders, rank and graphs of groups
- Cost of equivalence relations and groups
- Non-standard limits of graphs and some orbit equivalence invariants
- The combinatoral cost
- Limits of locally-globally convergent graph sequences
- Ergodic theory of amenable group actions. I: The Rohlin lemma
- Amenability, Kazhdan's property T, strong ergodicity and invariant means for ergodic group-actions
- Dynamical properties of profinite actions
- Bernoulli actions are weakly contained in any free action
- Sparse graphs: Metrics and random models
- Unnamed Item
This page was built for publication: Uniform rank gradient, cost, and local-global convergence