English

Small spectral radius and percolation constants on non-amenable Cayley graphs

Group Theory 2015-03-16 v3

Abstract

Motivated by the Benjamini-Schramm non-unicity of percolation conjecture we study the following question. For a given finitely generated non-amenable group Γ\Gamma, does there exist a generating set SS such that the Cayley graph (Γ,S)(\Gamma,S), without loops and multiple edges, has non-unique percolation, i.e., pc(Γ,S)<pu(Γ,S)p_c(\Gamma,S)<p_u(\Gamma,S)? We show that this is true if Γ\Gamma contains an infinite normal subgroup NN such that Γ/N\Gamma/ N is non-amenable. Moreover for any finitely generated group GG containing Γ\Gamma there exists a generating set SS' of GG such that pc(G,S)<pu(G,S)p_c(G,S')<p_u(G,S'). In particular this applies to free Burnside groups B(n,p)B(n,p) with n2,p665n \geq 2, p \geq 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.

Keywords

Cite

@article{arxiv.1206.2183,
  title  = {Small spectral radius and percolation constants on non-amenable Cayley graphs},
  author = {Kate Juschenko and Tatiana Nagnibeda},
  journal= {arXiv preprint arXiv:1206.2183},
  year   = {2015}
}
R2 v1 2026-06-21T21:17:18.046Z