Small spectral radius and percolation constants on non-amenable Cayley graphs
Abstract
Motivated by the Benjamini-Schramm non-unicity of percolation conjecture we study the following question. For a given finitely generated non-amenable group , does there exist a generating set S such that the Cayley graph (,S), without loops and multiple edges, has non-unique percolation, i.e., pc(,S)<pu(,S)? We show that this is true if contains an infinite normal subgroup N such that / N is non-amenable. Moreover for any finitely generated group G containing there exists a generating set S' of G such that pc(G,S')<pu(G,S'). In particular this applies to free Burnside groups B(n,p) with n ≥ 2, p ≥ 665. We also explore how various non-amenability numerics, such as the isoperimetric constant and the spectral radius, behave on various growing generating sets in the group.