A finitary structure theorem for vertex-transitive graphs of polynomial growth
From MaRDI portal
Publication:2036622
DOI10.1007/S00493-020-4295-6zbMATH Open1474.05343arXiv1908.06044OpenAlexW3080685157MaRDI QIDQ2036622FDOQ2036622
Matthew C. H. Tointon, Romain Teressa
Publication date: 29 June 2021
Published in: Combinatorica (Search for Journal in Brave)
Abstract: We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with finite vertex stabilisers. We also present some applications. We show that a finite, connected vertex-transitive graph G of large diameter admits a quotient with fibres of small diameter on which the action of Aut(G) is virtually abelian with vertex stabilisers of bounded size. We also show that G has moderate growth in the sense of Diaconis and Saloff-Coste, which is known to imply that the mixing and relaxation times of the lazy random walk on G are quadratic in the diameter. These results extend results of Breuillard and the second author for finite Cayley graphs of large diameter. Finally, given a connected, locally finite vertex-transitive graph G exhibiting polynomial growth at a single, sufficiently large scale, we describe its growth at subsequent scales, extending a result of Tao and an earlier result of our own for Cayley graphs. In forthcoming work we will give further applications.
Full work available at URL: https://arxiv.org/abs/1908.06044
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Random walks on graphs (05C81) Locally compact groups and their algebras (22D99)
Cites Work
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Title not available (Why is that?)
- Product set estimates for non-commutative groups
- A new proof of Gromov’s theorem on groups of polynomial growth
- INVERSE THEOREMS FOR SETS AND MEASURES OF POLYNOMIAL GROWTH
- The structure of approximate groups.
- A finitary version of Gromov's polynomial growth theorem.
- A conjecture concerning a limit of non-Cayley graphs
- Moderate growth and random walk on finite groups
- Quasi-isometries and rigidity of solvable groups
- Topological groups and infinite graphs
- Freiman's theorem in an arbitrary nilpotent group
- GRAPHS WITH POLYNOMIAL GROWTH
- A resistance bound via an isoperimetric inequality
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
- Title not available (Why is that?)
- On the structure of groups with polynomial growth
- Nilprogressions and groups with moderate growth
- The exclusion process mixes (almost) faster than independent particles
- A functional analysis proof of Gromov's polynomial growth theorem
- Filipe Folque and the teaching of astronomy at the politechnical school of Lison
- Properness of nilprogressions and the persistence of polynomial growth of given degree
- Introduction to Approximate Groups
Cited In (11)
- Cover-time Gumbel fluctuations in finite-range, symmetric, irreducible random walks on torus
- Gap at 1 for the percolation threshold of Cayley graphs
- Geometric amenability in totally disconnected locally compact groups
- The varentropy criterion is sharp on expanders
- Finite contractions of graphs with polynomial growth
- Explicit universal minimal constants for polynomial growth of groups
- A structure theorem for boundary-transitive graphs with infinitely many ends
- Limits of almost homogeneous spaces and their fundamental groups
- Mixing time and expansion of non-negatively curved Markov chains
- Mean field behavior during the big bang regime for coalescing random walks
- Locality of percolation for graphs with polynomial growth
This page was built for publication: A finitary structure theorem for vertex-transitive graphs of polynomial growth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036622)
