Characterizing a vertex-transitive graph by a large ball
Joint with Romain Tessera.
Which Cayley graphs can be approximated with other graphs? We deal with simple, connected unoriented, locally finite graphs.
Say graphs and are -close, with transitive, if every -ball of is isomorphic to the -ball in .
- If normal subgroups have , then converge to .
- If is not finitely presented, set . Then converge to .
- Beware that two non-isomorphic groups can have isomorphic Cayley graphs.
Two differences with soficity:
- no labels,
- no , i.e. balls should coincide exactly.
Definition 1 A transitive graph is local to global rigid if there exists such that for all graphs , -close to , is covered by .
- Regular trees are ltgr (with ).
- (Benjamini-Ellis). The -grid is ltgr (with ). Less obvious.
- (Georgakopoulos). Planar 1-ended transitive graphs are ltgr.
- Every Cayley graph of a torsion free groups of polynomial growth, lattices in simple real connected Lie groups are ltgr.
- Quasi-trees are ltgr.
- Bruhat-Tits buildings of , in characteristic 0, are ltgr.
- Every finitely presented group (with at least one element of infinite order) admits a ltgr Cayley graph.
- amits a non ltgr Cayley graph.
- is not ltgr, even among transitive graphs.
- (Caprace). There exists a torsion-free lattice in which is not ltgr.
1. Structure results
Most examples above follow from the following Theorem.
Theorem 2 If is large scale simply connected and is countable, then is ltgr.
Indeed, planar graphs, Cayley graphs of torsion free groups of polynomial growth (Trofimov), Cayley graphs of higher rank lattices (Furman) have countable automorphism groups.
Question. What about general groups of polynomial growth ?
By assumption, vertex stabilizers are finite. It follows that isometries are uniquely determined by their restriction to some ball. Therefore local isometries have unique extensions. Simple connectedness allows developing maps to be constructed.
Let be a group generated by finite subset . Assume that is infinite, i.e. has uncountably many different 2-fold coverings. The kernel of the obvious homomorphism does the job. Observe that both and contain .
By assumption, one can approximate the obvious graph in uncountably many different ways. Pick generating system of such that . A careful choice of allows to recongnize just from the local combinatorics the edges from the other ones, and thus to show invariance of the 2-fold covering map.
The main ingredient is a variant of the following fact: every group with an element of finite order has a Cayley graph with countable isometry group.